Sciweavers

4781 search results - page 575 / 957
» Online algorithms for network design
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 3 months ago
Selective Call Out and Real Time Bidding
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...

Publication
234views
13 years 10 months ago
Road Scene Understanding from a Single Image
Road scene segmentation is important in computer vision for different applications such as autonomous driving and pedestrian detection. Recovering the 3D structure of road scenes ...
Jose M. Alvarez, Theo Gevers, Yann LeCun, Antonio ...
173
Voted
INFOCOM
2006
IEEE
16 years 24 days ago
Effective Packet Scheduling with Fairness Adaptation in Ultra Wideband Wireless Networks
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
Hai Jiang, Weihua Zhuang
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
16 years 1 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...