Sciweavers

530 search results - page 10 / 106
» Universal randomized switching
Sort
View
SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
15 years 6 months ago
An Accurate Evaluation of Maurer's Universal Test
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
Jean-Sébastien Coron, David Naccache
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 1 months ago
A Neyman-Pearson Approach to Universal Erasure and List Decoding
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propo...
Pierre Moulin
118
Voted
TSMC
1998
135views more  TSMC 1998»
15 years 1 months ago
Universal stabilization using control Lyapunov functions, adaptive derivative feedback, and neural network approximators
— In this paper, the problem of stabilization of unknown nonlinear dynamical systems is considered. An adaptive feedback law is constructed that is based on the switching adaptiv...
Elias B. Kosmatopoulos
118
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints
— This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in...
Vartika Bhandari, Nitin H. Vaidya
89
Voted
NIPS
2003
15 years 3 months ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola