Sciweavers

238 search results - page 44 / 48
» Parallel Algorithm for Maximum Weight Matching in Trees
Sort
View
SPAA
2006
ACM
15 years 3 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
15 years 6 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
PODC
2006
ACM
15 years 3 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
3DPVT
2006
IEEE
183views Visualization» more  3DPVT 2006»
15 years 3 months ago
High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming
We present a stereo algorithm that achieves high quality results while maintaining real-time performance. The key idea is simple: we introduce an adaptive aggregation step in a dy...
Liang Wang, Miao Liao, Minglun Gong, Ruigang Yang,...
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 1 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld