Sciweavers

354 search results - page 14 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
NSDI
2007
15 years 2 months ago
Ricochet: Lateral Error Correction for Time-Critical Multicast
Ricochet is a low-latency reliable multicast protocol designed for time-critical clustered applications. It uses IP Multicast to transmit data and recovers from packet loss in end...
Mahesh Balakrishnan, Kenneth P. Birman, Amar Phani...
ADHOC
2005
95views more  ADHOC 2005»
14 years 11 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen
CVPR
2008
IEEE
16 years 1 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 6 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
BTW
2007
Springer
121views Database» more  BTW 2007»
15 years 5 months ago
Algorithms for merged indexes
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
Goetz Graefe