Sciweavers

497 search results - page 36 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
VTC
2010
IEEE
140views Communications» more  VTC 2010»
14 years 8 months ago
Analysis of Local Quasi-Stationarity Regions in an Urban Macrocell Scenario
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
JMLR
2010
119views more  JMLR 2010»
14 years 4 months ago
A Convergent Online Single Time Scale Actor Critic Algorithm
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
Dotan Di Castro, Ron Meir
CVPR
2006
IEEE
15 years 11 months ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...
UAI
1997
14 years 11 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
JMLR
2012
13 years 6 days ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski