Sciweavers

226 search results - page 30 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
IPPS
2005
IEEE
14 years 1 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 8 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
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...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
SIGOPS
2010
126views more  SIGOPS 2010»
13 years 6 months ago
Scaling a monitoring infrastructure for the Akamai network
We describe the design of, and experience with, Query, a monitoring system that supports the Akamai EdgePlatform. Query is a foundation of Akamai’s approach to administering its...
Thomas Repantis, Jeff Cohen, Scott Smith, Joel Wei...