999 search results - page 110 / 200 » Finding shapes in a set of points |
192
click to vote
ISAAC
2007
Springer
16 years 13 days 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 ...
229
click to vote
ECCV
2010
Springer
15 years 7 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...
161
click to vote
VISUALIZATION
1996
IEEE
15 years 10 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...
194
click to vote
GECCO
2007
Springer
15 years 10 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 ...
193
click to vote
JMLR
2006
15 years 6 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...