Sciweavers

Share
320 search results - page 1 / 64
» Better streaming algorithms for clustering problems
Sort
View
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
10 years 2 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
ICDT
2009
ACM
148views Database» more  ICDT 2009»
10 years 3 months ago
Tight results for clustering and summarizing data streams
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...
Sudipto Guha
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
9 years 8 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
9 years 7 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
JCP
2008
103views more  JCP 2008»
9 years 2 months ago
Weighted Clustering and Evolutionary Analysis of Hybrid Attributes Data Streams
It presents some definitions of projected cluster and projected cluster group on hybrid attributes after having given some definitions on ordered attributes and sorted attributes t...
Xinquan Chen
books