Sciweavers

835 search results - page 101 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
132
Voted
CORR
2010
Springer
171views Education» more  CORR 2010»
14 years 7 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
86
Voted
FOCS
1993
IEEE
15 years 4 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
STACS
1999
Springer
15 years 4 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
75
Voted
ICIP
2009
IEEE
16 years 1 months ago
Dequantizing Compressed Sensing With Non-gaussian Constraints
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
131
Voted
UAI
2004
15 years 1 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby