256 search results - page 13 / 52 » Approximation Algorithms for Hamming Clustering Problems |
215
click to vote
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
105
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
129
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
137
click to vote
ICML
2001
IEEE
16 years 3 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
141
click to vote
CLUSTER
2001
IEEE
15 years 6 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...