Sciweavers

3415 search results - page 334 / 683
» Lower bounds on kernelization
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 8 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 8 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
CORR
2006
Springer
86views Education» more  CORR 2006»
15 years 6 months ago
Optimal Distortion-Power Tradeoffs in Sensor Networks: Gauss-Markov Random Processes
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 6 months ago
Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka