817 search results - page 13 / 164 » Robust Euclidean embedding |
133
click to vote
ISSAC
1998
Springer
15 years 8 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
147
click to vote
CVPR
2008
IEEE
2008
IEEE
Quasi-perspective projection with applications to 3D factorization from uncalibrated image sequences
16 years 6 months ago
The paper addresses the problem of factorization-based 3D reconstruction from uncalibrated image sequences. We propose a quasi-perspective projection model and apply the model to ...
186
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
140
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
169
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...