Sciweavers

3360 search results - page 363 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
ADHOC
2006
97views more  ADHOC 2006»
15 years 6 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
IPPS
2007
IEEE
16 years 1 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
SPAA
2003
ACM
16 years 9 hour ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
IPPS
1999
IEEE
15 years 11 months ago
GA-Based Parallel Image Registration on Parallel Clusters
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...
Prachya Chalermwat, Tarek A. El-Ghazawi, Jacquelin...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 7 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...