Sciweavers

269 search results - page 15 / 54
» Conditionalization and total knowledge
Sort
View
GOSLER
1995
13 years 11 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 2 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
AAAI
1996
13 years 8 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
JSAC
2007
104views more  JSAC 2007»
13 years 7 months ago
Tomlinson-Harashima Precoding for Broadcast Channels with Uncertainty
— We consider the design of Tomlinson-Harashima (TH) precoders for broadcast channels in the presence of channel uncertainty. For systems in which uplink-downlink reciprocity is ...
Michael Botros Shenouda, Timothy N. Davidson
CVPR
2004
IEEE
14 years 9 months ago
Separating Reflections from a Single Image Using Local Features
When we take a picture through a window the image we obtain is often a linear superposition of two images: the image of the scene beyond the window plus the image of the scene ref...
Anat Levin, Assaf Zomet, Yair Weiss