1029 search results - page 103 / 206 » Local Minima Embedding |
118
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In video surveillance, the sizes of face images are very small. However, few works have been done to investigate scalerobust face recognition. Our experiments on appearancebased m...
115
click to vote
CIE
2008
Springer
15 years 5 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
128
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
161
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
130
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
Face localization is the process of finding the exact position of a face in a given image. This can be useful in several applications such as face tracking or person authenticatio...