7006 search results - page 54 / 1402 » Approximation Algorithms |
122
click to vote
STOC
1989
ACM
15 years 3 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
104
click to vote
KDD
2008
ACM
16 years 7 days ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
115
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
120
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...