Sciweavers

2370 search results - page 103 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
ICPP
2000
IEEE
15 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
15 years 2 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
MICCAI
2002
Springer
15 years 10 months ago
Validation of Image Segmentation and Expert Quality with an Expectation-Maximization Algorithm
Characterizing the performance of image segmentation approaches has been a persistent challenge. Performance analysis is important since segmentation algorithms often have limited ...
Simon K. Warfield, Kelly H. Zou, William M. Wells ...
SENSYS
2003
ACM
15 years 3 months ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin