999 search results - page 110 / 200 » Finding shapes in a set of points |
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
120
click to vote
ECCV
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper we present a new method for the 3D reconstruction of highly deforming surfaces (for instance a flag waving in the wind) viewed by a single orthographic came...
VISUALIZATION
1996
IEEE
15 years 2 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
104
click to vote
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
JMLR
2006
14 years 9 months ago
2006
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...