7351 search results - page 1080 / 1471 » Segmenting Point Sets |
181
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
169
click to vote
ATAL
2003
Springer
16 years 1 days ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
237
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
192
click to vote
ICCV
1998
IEEE
15 years 11 months ago
1998
IEEE
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
201
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...