Sciweavers

945 search results - page 82 / 189
» Working the Flow
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 10 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
GCC
2007
Springer
14 years 4 months ago
Adapting to Application Workflow in Processing Data Integration Queries
Data integration has evolved to provide efficient data management across distributed and heterogeneous data sources in grid environment. However, existing works in data integratio...
Yongwei Wu, Jia Liu, Gang Chen, Guangwen Yang, Bo ...
DAGM
2006
Springer
14 years 1 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
IC
2004
13 years 11 months ago
Controlling Inbound Traffic
This work considers the problem of prioritizing the inbound TCP traffic of an organization network. The objective is to allocate dynamically a specific share of the incoming link ...
Saad Biaz
CCS
2010
ACM
13 years 10 months ago
CRAFT: a new secure congestion control architecture
Congestion control algorithms seek to optimally utilize network resources by allocating a certain rate for each user. However, malicious clients can disregard the congestion contr...
Dongho Kim, Jerry T. Chiang, Yih-Chun Hu, Adrian P...