7930 search results - page 285 / 1586 » Greedy in Approximation Algorithms |
201
click to vote
IDA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
178
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
152
click to vote
APPROX
2004
Springer
16 years 13 hour ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
181
click to vote
APPROX
1998
Springer
15 years 11 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
169
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...