905 search results - page 65 / 181 » On the Complexity of uSPR Distance |
105
click to vote
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
DAM
2007
14 years 9 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
227
click to vote
Publication
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...
JCSS
2007
14 years 9 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
CVPR
2000
IEEE
15 years 12 months ago
2000
IEEE
This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature....