Sciweavers

97 search results - page 8 / 20
» Tight lower bounds for halfspace range searching
Sort
View
TELSYS
2002
122views more  TELSYS 2002»
13 years 8 months ago
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...
George C. Lin, Tatsuya Suda, Fumio Ishizaki
GLOBECOM
2008
IEEE
14 years 3 months ago
Prioritized Maximal Scheduling in Wireless Networks
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
Qiao Li, Rohit Negi
ICCAD
1997
IEEE
131views Hardware» more  ICCAD 1997»
14 years 1 months ago
COSMOS: a continuous optimization approach for maximum power estimation of CMOS circuits
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...
Chuan-Yu Wang, Kaushik Roy
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 9 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
PE
2002
Springer
150views Optimization» more  PE 2002»
13 years 8 months ago
Delimiting the range of effectiveness of scalable on-demand streaming
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
Haonan Tan, Derek L. Eager, Mary K. Vernon