2137 search results - page 281 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
147
click to vote
DAM
2006
15 years 6 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
242
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
179
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
188
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
169
Voted
IJCV
2012
13 years 8 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...