53 search results - page 5 / 11 » Maximal Lattice-Free Convex Sets in Linear Subspaces |
TIT
2011
13 years 1 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
PAMI
2007
13 years 6 months ago
2007
—We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object’s appearance due to changing camera pose and li...
CCCG
2009
13 years 8 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
WEBI
2010
Springer
13 years 4 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
IVC
2006
13 years 7 months ago
2006
This paper investigates the use of range images of faces for recognizing people. 3D scans of faces lead to range images that are linearly projected to low-dimensional subspaces fo...