• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 19,963
Next 10 →

approximation errors

by École Normale, Supérieure Lyon, Sylvain Chevillard, John Harrison, Christoph Lauter, École Normale, Supérieure Lyon, Sylvain Chevillard, John Harrison, Christoph Lauter, École Normale, Supérieure Lyon , 2010
"... For purposes of actual evaluation, mathematical functions f are commonly replaced by approximation polynomials p. Examples include floating-point implementations of elementary functions, quadrature or more theoretical proof work involving transcendental functions. Replacing f by p induces a relative ..."
Abstract - Add to MetaCart
For purposes of actual evaluation, mathematical functions f are commonly replaced by approximation polynomials p. Examples include floating-point implementations of elementary functions, quadrature or more theoretical proof work involving transcendental functions. Replacing f by p induces a

Approximation Errors

by Nathan W. Panike, Fort George G. Meade , 2008
"... A bound on the error introduced by truncating a quantum addition is given. This bound shows that only a few controlled rotation gates will be necessary to get a reliable computation. ..."
Abstract - Add to MetaCart
A bound on the error introduced by truncating a quantum addition is given. This bound shows that only a few controlled rotation gates will be necessary to get a reliable computation.

Approximation Error Maps

by Anamaria Gomide, Jorge Stolfi , 2001
"... Let F and A be two linear function spaces defined on some domain \Omega, and let |*| be a vector semi-norm for the space A + F. We consider here the question of how well A approximates F in the sense of the metric |*|. Global error measures are insuficiently informative when the space A is not spati ..."
Abstract - Add to MetaCart
Let F and A be two linear function spaces defined on some domain \Omega, and let |*| be a vector semi-norm for the space A + F. We consider here the question of how well A approximates F in the sense of the metric |*|. Global error measures are insuficiently informative when the space A

Exact and Approximated Error of the FMA

by Sylvie Boldo, Jean-michel Muller , 2011
"... The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already available on some current processors such as the Power PC or the Itanium. We first extend an earlier work on the computation of the exa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
of the exact error of an FMA (by giving more general conditions and providing a formal proof). Then, we present a new algorithm that computes an approximation to the error of an FMA, and provide error bounds and a formal proof for that algorithm.

COMPARISON OF THE APPROXIMATION ERRORS OF THE PREFILTERED

by Athanasios P. Liavas, P. A. Regalia, Jean-pierre Delmas
"... Abstract—We study the performance of the linear prediction (LP) method for blind channel identification when the true channel is of order, whereas the channel model is of order, with.By partitioning the true channel into the th-order significant part and the unmodeled tails, we show that the LP meth ..."
Abstract - Add to MetaCart
the approximation performance of a special FIR prefilter. The results show that the convergent rate of the prefiltered projection is the same as that of the orthogonal projection. In addition, for bandlimited signals, the quantitative estimates of the upper bounds of the three types of errors are obtained

Sample Complexity versus Approximation Error

by Peter L. Bartlett, Robert C. Williamson
"... We consider the problem of learning an unknown real-valued function from a sequence of values of the function at randomly chosen points when the estimates are constrained to some class of functions called the hypothesis class. Ideally, thehypothesis class should be able to approximate a wide variety ..."
Abstract - Add to MetaCart
variety of target functions, yet not need an excessive number of examples to ensure that a learning algorithm can choose a near-optimal approximation to the target function. We show that these two objectives are incompatible, in the sense that as the approximation error of the hypothesis class decreases

Sequential data assimilation with a nonlinear quasi-geostrophic model using Monte Carlo methods to forecast error statistics

by Geir Evensen - J. Geophys. Res , 1994
"... . A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The ..."
Abstract - Cited by 800 (23 self) - Add to MetaCart
. A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter

Surface Simplification Using Quadric Error Metrics

by Michael Garland, Paul S. Heckbert
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract - Cited by 1174 (16 self) - Add to MetaCart
simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm

Greed is Good: Algorithmic Results for Sparse Approximation

by Joel A. Tropp , 2004
"... This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal representa ..."
Abstract - Cited by 916 (9 self) - Add to MetaCart
is an approximation algorithm for the sparse problem over a quasi-incoherent dictionary. That is, for every input signal, OMP calculates a sparse approximant whose error is only a small factor worse than the minimal error that can be attained with the same number of terms.

A Guided Tour to Approximate String Matching

by Gonzalo Navarro - ACM COMPUTING SURVEYS , 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract - Cited by 598 (36 self) - Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining
Next 10 →
Results 1 - 10 of 19,963
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University