536 search results - page 62 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
131
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
119
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. Bottom-up approaches, which rely mainly on continuity principles, are often insufficient to form accurate segments in natural images. In order to improve performance, rec...
113
click to vote
SIGGRAPH
2010
ACM
15 years 6 months ago
2010
ACM
We show how to greatly accelerate self-collision detection (SCD) for reduced deformable models. Given a triangle mesh and a set of deformation modes, our method precomputes Subspa...
IDA
1997
Springer
15 years 6 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
101
click to vote
VVS
1996
IEEE
15 years 6 months ago
1996
IEEE
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...