497 search results - page 37 / 100 » Approximating max-min linear programs with local algorithms |
106
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
108
click to vote
IPCO
2008
14 years 11 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
PROMISE
2010
14 years 4 months ago
2010
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Local experts have been used to great effect for fitting deformable
models to images. Typically, the best location in
an image for the deformable model’s landmarks are found
t...