Sciweavers

657 search results - page 47 / 132
» A Version Numbering Scheme with a Useful Lexicographical Ord...
Sort
View
INFOCOM
1999
IEEE
15 years 2 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
VTC
2010
IEEE
163views Communications» more  VTC 2010»
14 years 8 months ago
Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
Yusita Kasdani, Yong Huat Chew, Chau Yuen, Woon Ha...
INFOCOM
2012
IEEE
13 years 6 days ago
Estimators also need shared values to grow together
—Network management applications require large numbers of counters in order to collect traffic characteristics for each network flow. However, these counters often barely fit ...
Erez Tsidon, Iddo Hanniel, Isaac Keslassy
ICCV
2005
IEEE
15 years 11 months ago
Towards Ultimate Motion Estimation: Combining Highest Accuracy with Real-Time Performance
Although variational methods are among the most accurate techniques for estimating the optical flow, they have not yet entered the field of real-time vision. Main reason is the gr...
Andrés Bruhn, Joachim Weickert
FCT
2005
Springer
15 years 3 months ago
The Maximum Resource Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...