Sciweavers

207 search results - page 41 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
MOBICOM
2006
ACM
13 years 11 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
SPAA
2004
ACM
13 years 11 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
13 years 10 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
INFOCOM
2006
IEEE
13 years 11 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz
TIP
2008
107views more  TIP 2008»
13 years 5 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega