Sciweavers

1074 search results - page 64 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 3 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
AC
2008
Springer
14 years 10 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah
FOCS
2000
IEEE
15 years 2 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
15 years 10 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...