1554 search results - page 149 / 311 » Parameterized Complexity and Approximation Algorithms |
120
Voted
ICCSA
2010
Springer
15 years 10 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
129
Voted
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
130
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
150
Voted
NIPS
2007
15 years 4 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
229
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...