Sciweavers

311 search results - page 28 / 63
» Better streaming algorithms for clustering problems
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
ASPLOS
1991
ACM
13 years 11 months ago
Code Generation for Streaming: An Access/Execute Mechanism
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
Manuel E. Benitez, Jack W. Davidson
MASS
2010
172views Communications» more  MASS 2010»
13 years 5 months ago
Routing and spectrum allocation for video on-demand streaming in cognitive wireless mesh networks
Cognitive radio, which enables dynamic access of under-utilized licensed spectrums, is a promising technology for more efficient spectrum utilization. Since cognitive radio enables...
Yong Ding, Li Xiao
COCOON
2010
Springer
14 years 6 days ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 7 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...