314 search results - page 50 / 63 » Computing all Suboptimal Alignments in Linear Space |
TCS
2010
13 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We address the problem of tracking and recognizing faces in real-world, noisy videos. We track faces using a tracker that adaptively builds a target model reflecting changes in ap...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
A visual representation of an object must meet at least three basic requirements. First, it must allow identification of the object in the presence of slight but unpredictable chan...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...