Sciweavers

6110 search results - page 30 / 1222
» Approximate Computing
Sort
View
ARITH
2007
IEEE
14 years 4 months ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot
EURONGI
2005
Springer
14 years 3 months ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...
JUCS
2008
151views more  JUCS 2008»
13 years 9 months ago
Bloch's Constant is Computable
: We prove the computability of Bloch's constant by presenting the first algorithm approximating the constant up to arbitrary precision. Key Words: computability, algorithm, B...
Robert Rettinger
COMPUTING
2006
99views more  COMPUTING 2006»
13 years 9 months ago
Computation of Singular Integral Operators in Wavelet Coordinates
With respect to a wavelet basis, singular integral operators can be well approximated by sparse matrices, and in [Found. Comput. Math., 2 (2002), pp. 203
T. Gantumur, R. P. Stevenson
ICPR
2008
IEEE
14 years 4 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov