300 search results - page 58 / 60 » Constrained Nearest Neighbor Queries |
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
CVPR
2009
IEEE
15 years 26 days ago
2009
IEEE
Several spatiotemporal feature point detectors have been recently used in video analysis for action recognition. Feature points are detected using a number of measures, namely sali...
TIFS
2008
13 years 5 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
ICPR
2008
IEEE
14 years 5 days ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...