57 search results - page 7 / 12 » Closest point search in lattices |
ICRA
2003
IEEE
14 years 21 days ago
2003
IEEE
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Explicit surfaces, such as triangulations or wireframe models, have been extensively used to represent the deformable 3?D models that are used to fit 3?D point and 2?D silhouette ...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
COLING
2010
13 years 2 months ago
2010
Traditional 1-best translation pipelines suffer a major drawback: the errors of 1best outputs, inevitably introduced by each module, will propagate and accumulate along the pipeli...