Sciweavers

1879 search results - page 158 / 376
» Computational geometry algorithms library
Sort
View
PAMI
2008
391views more  PAMI 2008»
15 years 4 months ago
Riemannian Manifold Learning
Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold...
Tong Lin, Hongbin Zha
ICRA
2010
IEEE
132views Robotics» more  ICRA 2010»
15 years 3 months ago
Sampling-based motion planning with temporal goals
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
FOCS
2009
IEEE
15 years 11 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 3 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
ECCV
2008
Springer
16 years 6 months ago
Non-local Regularization of Inverse Problems
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
Gabriel Peyré, Laurent D. Cohen, Séb...