Sciweavers

2095 search results - page 148 / 419
» Improved pebbling bounds
Sort
View
JSAC
2006
89views more  JSAC 2006»
15 years 6 months ago
Robust multiuser detection for multicarrier CDMA systems
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
Rensheng Wang, Hongbin Li, Tao Li
TCS
2008
15 years 6 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
JMLR
2002
83views more  JMLR 2002»
15 years 6 months ago
On Online Learning of Decision Lists
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
Ziv Nevo, Ran El-Yaniv
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 5 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...
INFOCOM
2010
IEEE
15 years 5 months ago
Worst-Case TCAM Rule Expansion
—Designers of TCAMs (ternary CAMs) for packet classification often have to deal with unpredictable sets of rules. These result in highly variable rule expansions, and can only r...
Ori Rottenstreich, Isaac Keslassy