Sciweavers

2374 search results - page 82 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 7 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
INFOCOM
2005
IEEE
14 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
SAC
2008
ACM
13 years 9 months ago
Fast self-healing gradients
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Selfhealing gradients are a frequently used building block for distribut...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
IPPS
2002
IEEE
14 years 3 months ago
A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
Kang Chen, Jeremy R. Johnson
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
14 years 2 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman