2600 search results - page 251 / 520 » Clustering with or without the Approximation |
354
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
190
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
154
click to vote
CLUSTER
2004
IEEE
15 years 10 months ago
2004
IEEE
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
247
Voted
PODS
2009
ACM
16 years 7 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
170
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...