7150 search results - page 71 / 1430 » An Approximation Algorithm for Approximation Rank |
112
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
73
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
104
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
112
Voted
KDD
2008
ACM
16 years 1 months 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...
124
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...