13841 search results - page 2454 / 2769 » Algorithms and Constraint Programming |
152
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
231
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
251
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
145
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
163
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...