113 search results - page 5 / 23 » Large Subposets with Small Dimension |
SODA
1993
ACM
14 years 11 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a method for face recognition based on a discriminative linear projection. In this formulation images are treated as tensors, rather than the more conventional vector o...
TIP
2010
14 years 4 months ago
2010
We propose algorithms for tracking the boundary contour of a deforming object from an image sequence, when the nonaffine (local) deformation over consecutive frames is large and th...
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
It is well known that editing techniques can be applied to (large) sets of prototypes in order to bring the error rate of the Nearest Neighbour classifier close to the optimal Ba...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...