Sciweavers

2310 search results - page 435 / 462
» Coloring Random Graphs
Sort
View
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 7 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 7 months ago
Understanding the Properties of the BitTorrent Overlay
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
Anwar Al Hamra, Arnaud Legout, Chadi Barakat
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 7 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
JCO
2006
126views more  JCO 2006»
13 years 7 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
PERVASIVE
2008
Springer
13 years 7 months ago
A fair and energy-efficient topology control protocol for wireless sensor networks
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...
Rami Mochaourab, Waltenegus Dargie