Sciweavers

593 search results - page 85 / 119
» Optimal Distributed Multicast Routing using Network Coding
Sort
View
DMSN
2004
ACM
15 years 7 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
116
Voted
IPPS
2008
IEEE
15 years 8 months ago
On utilization of contributory storage in desktop grids
Modern desktop grid environments and shared computing platforms have popularized the use of contributory resources, such as desktop computers, as computing substrates for a variet...
Chreston Miller, Ali Raza Butt, Patrick Butler
IPPS
2005
IEEE
15 years 8 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
BIOINFORMATICS
2011
14 years 9 months ago
Inverse perturbation for optimal intervention in gene regulatory networks
Motivation: Analysis and intervention in the dynamics of gene regulatory networks is at the heart of emerging efforts in the development of modern treatment of numerous ailments i...
Nidhal Bouaynaya, Roman Shterenberg, Dan Schonfeld
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 6 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve