Sciweavers

486 search results - page 28 / 98
» Improved upper bounds for 3-SAT
Sort
View
VTC
2008
IEEE
218views Communications» more  VTC 2008»
14 years 2 months ago
Performance Analysis of a System using Coordinate Interleaving and Constellation Rotation in Rayleigh Fading Channels
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...
Nauman F. Kiyani, Jos H. Weber, Alenka G. Zajic, G...
CC
2006
Springer
125views System Software» more  CC 2006»
13 years 8 months ago
A tight lower bound for restricted pir protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
Richard Beigel, Lance Fortnow, William I. Gasarch
MP
2006
88views more  MP 2006»
13 years 8 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
ICALP
2011
Springer
12 years 12 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
CIMCA
2008
IEEE
14 years 3 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis