Sciweavers

3415 search results - page 471 / 683
» Lower bounds on kernelization
Sort
View
JACM
2008
90views more  JACM 2008»
15 years 6 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
JAIR
2008
130views more  JAIR 2008»
15 years 6 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
CORR
2007
Springer
148views Education» more  CORR 2007»
15 years 6 months ago
Blind Estimation of Multiple Carrier Frequency Offsets
Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received sign...
Yuanning Yu, Athina P. Petropulu, H. Vincent Poor,...
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
Verified Real Number Calculations: A Library for Interval Arithmetic
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
Marc Daumas, David Lester, César Muñ...
CORR
2007
Springer
101views Education» more  CORR 2007»
15 years 6 months ago
On The Limitations of The Naive Lattice Decoding
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...
Mahmoud Taherzadeh, Amir K. Khandani