1604 search results - page 120 / 321 » Approximation algorithms for developable surfaces |
112
click to vote
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
135
Voted
ICST
2010
IEEE
15 years 2 days ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
101
click to vote
SIAMNUM
2010
14 years 8 months ago
2010
Abstract. In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivit...
102
click to vote
SIGGRAPH
1990
ACM
15 years 5 months ago
1990
ACM
Rapid developments in the design of algorithms for rendering globally illuminated scenes have taken place in the past five years. Net energy methods such as the hemicube and other...
125
Voted
VISUALIZATION
2003
IEEE
15 years 6 months ago
2003
IEEE
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...