Sciweavers

3038 search results - page 144 / 608
» High-Speed Function Approximation
Sort
View
160
Voted
COMPGEOM
2000
ACM
15 years 9 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
156
Voted
ICCV
1995
IEEE
15 years 8 months ago
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
Gabriel Taubin
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
15 years 5 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
143
Voted
CMA
2010
91views more  CMA 2010»
15 years 1 days ago
Numerical approximation of electromagnetic signals arising in the evaluation of geological formations
The integration of complicated oscillatory functions arises in computational electromagnetics when evaluating signals produced by the propagation of electromagnetic radiation thro...
Alexandre Caboussat, G. K. Miers
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 12 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy