Sciweavers

867 search results - page 94 / 174
» Network Robustness and Graph Topology
Sort
View
DMSN
2004
ACM
14 years 1 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
IPPS
2002
IEEE
14 years 23 days ago
Toward Optimal Diffusion Matrices
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
Robert Elsässer, Burkhard Monien, Günter...
WISES
2008
13 years 9 months ago
Establishing wireless time-triggered communication using a firefly clock synchronization approach
In South-East Asia, huge swarms of fireflies synchronously emit light flashes to attract mating partners. The underlying principle can be used to implement a robust and scalable d...
Robert Leidenfrost, Wilfried Elmenreich
IJCV
2006
299views more  IJCV 2006»
13 years 7 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 8 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan