Sciweavers

182 search results - page 13 / 37
» Simple Generalized Maximum Flow Algorithms
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
VISUALIZATION
1992
IEEE
13 years 11 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
STOC
2006
ACM
180views Algorithms» more  STOC 2006»
14 years 8 months ago
Pricing for fairness: distributed resource allocation for multiple objectives
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
Sung-woo Cho, Ashish Goel
ICIP
2007
IEEE
14 years 9 months ago
Direct Motion Estimation in the Radon Transform Domain using Match-Profile Backprojections
Integral projections have been proposed as an efficient method to reduce the dimensionality of the search space in motion estimation (ME) algorithms. A number of papers describe m...
Chris Bartels, Gerard de Haan
MOBIHOC
2003
ACM
14 years 1 months ago
Improving fairness among TCP flows crossing wireless ad hoc and wired networks
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
Luqing Yang, Winston Khoon Guan Seah, Qinghe Yin