2093 search results - page 157 / 419 » Statistical Point Geometry |
128
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
122
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of document classification considers categorizing or grouping of various document types. Each document can be represented as a bag of words, which has no straightforw...
111
Voted
ICIP
2007
IEEE
16 years 5 months ago
2007
IEEE
If precise calibration information is unavailable, as is often the case for active binocular vision systems, the determination of epipolar lines becomes untenable. Yet, even witho...
257
Voted
VIS
2004
IEEE
16 years 5 months ago
2004
IEEE
We present a novel surface reconstruction algorithm that can recover high-quality surfaces from noisy and defective data sets without any normal or orientation information. A set ...
120
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...