3874 search results - page 639 / 775 » Approximation Algorithms for k-hurdle Problems |
132
click to vote
PVLDB
2010
15 years 2 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...
127
Voted
BMVC
2010
15 years 1 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...
162
Voted
ICDM
2010
IEEE
15 years 1 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 ...
131
click to vote
JGO
2010
14 years 10 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...
169
click to vote
SIAMSC
2011
14 years 10 months ago
2011
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...