Results 1  10
of
18,392
On simple approximations to simple curves
, 2010
"... We show that the property of a planar parametric curve of being simple, is preserved by an approximation when the curve is piecewise smooth and generalized regular, provided that the errors to the curve and its tangent vectors are sufficiently small. To this purpose, we provide also an explicit erro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that the property of a planar parametric curve of being simple, is preserved by an approximation when the curve is piecewise smooth and generalized regular, provided that the errors to the curve and its tangent vectors are sufficiently small. To this purpose, we provide also an explicit
Simple approximations for condensational growth
, 2008
"... A simple geometric argument relating to the liquid water content of clouds is given. The phase relaxation time and the nature of the quasisteady approximation for the diffusional growth of cloud drops are elucidated directly in terms of water vapor concentration. Spatial gradients of vapor concentr ..."
Abstract
 Add to MetaCart
A simple geometric argument relating to the liquid water content of clouds is given. The phase relaxation time and the nature of the quasisteady approximation for the diffusional growth of cloud drops are elucidated directly in terms of water vapor concentration. Spatial gradients of vapor
Some simple effective approximations to the 2Poisson model for probabilistic weighted retrieval
 In Proceedings of SIGIR’94
, 1994
"... The 2–Poisson model for term frequencies is used to suggest ways of incorporating certain variables in probabilistic models for information retrieval. The variables concerned are withindocument term frequency, document length, and withinquery term frequency. Simple weighting functions are develope ..."
Abstract

Cited by 460 (14 self)
 Add to MetaCart
The 2–Poisson model for term frequencies is used to suggest ways of incorporating certain variables in probabilistic models for information retrieval. The variables concerned are withindocument term frequency, document length, and withinquery term frequency. Simple weighting functions
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1211 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Valuing American options by simulation: A simple leastsquares approach
 Review of Financial Studies
, 2001
"... This article presents a simple yet powerful new approach for approximating the value of America11 options by simulation. The kcy to this approach is the use of least squares to estimate the conditional expected payoff to the optionholder from continuation. This makes this approach readily applicable ..."
Abstract

Cited by 517 (9 self)
 Add to MetaCart
This article presents a simple yet powerful new approach for approximating the value of America11 options by simulation. The kcy to this approach is the use of least squares to estimate the conditional expected payoff to the optionholder from continuation. This makes this approach readily
Dummynet: A Simple Approach to the Evaluation of Network Protocols
 ACM Computer Communication Review
, 1997
"... Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate mo ..."
Abstract

Cited by 484 (6 self)
 Add to MetaCart
Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate
A Simple Approximation to MinimumDelay Routing
 Proc. of ACM SIGCOMM
, 1999
"... The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Singlepath routing is very responsive to topological and linkcost changes; however, except under light traffic loads, the delays obtained with t ..."
Abstract

Cited by 84 (9 self)
 Add to MetaCart
slowly changing. We present a "nearoptimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as singlepath routing protocols proposed to date. First, an approximation to the Gallager's minimumdelay routing problem
Simple Approximations to Null Sampling Variances
"... Procedures for significance testing and confidence interval estimation of several employed measures of association have been available for several years, but rarely used, possibly because of the lengthy computations entailed. Simple formulas involving the sample size and the number of rows and colum ..."
Abstract
 Add to MetaCart
and columns in the crossclassification have been found to closely approximate formulas suitable for significance testing under a wide variety of circumstances. Although this remarkable stability of the asymptotic variances extends to many nonnull populations, the use of the simple formulas to approximate
A Simple Approximation Algorithm in. . .
, 1996
"... We describe a very simple and efficient new algorithm for the approximation of complex numbers by algebraic integers in Z[e 2i=8 ] whose coeffcients with respect to the usual basis are bounded in absolute value by a given integer M . Its main idea is the use of a novel signature technique. An impo ..."
Abstract
 Add to MetaCart
We describe a very simple and efficient new algorithm for the approximation of complex numbers by algebraic integers in Z[e 2i=8 ] whose coeffcients with respect to the usual basis are bounded in absolute value by a given integer M . Its main idea is the use of a novel signature technique
Results 1  10
of
18,392