2980 search results - page 450 / 596 » Computational Geometry |
149
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...
199
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
176
click to vote
COMPGEOM
2009
ACM
16 years 27 days 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...
193
click to vote
IBPRIA
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. It has recently been demonstrated that the fundamental computer vision problem of structure from motion with a single camera can be tackled using the sequential, probabil...
180
click to vote
COMPGEOM
2006
ACM
16 years 11 days ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...