5595 search results - page 938 / 1119 » Approximation Algorithms for Clustering Problems |
181
click to vote
PAMI
2010
15 years 4 months ago
2010
—This paper addresses the problem of robust template tracking in image sequences. Our work falls within the discriminative framework in which the observations at each frame yield...
171
click to vote
PVLDB
2010
15 years 4 months ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
159
Voted
BMVC
2010
15 years 4 months ago
2010
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
195
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
164
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...