Sciweavers

327 search results - page 49 / 66
» Algorithms for infinite huffman-codes
Sort
View
IOR
2006
163views more  IOR 2006»
13 years 6 months ago
Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
T. P. I. Ahamed, Vivek S. Borkar, S. Juneja
JDA
2006
77views more  JDA 2006»
13 years 6 months ago
On Multi-threaded Metrical Task Systems
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
Esteban Feuerstein, Steven S. Seiden, Alejandro St...
IJCV
2002
111views more  IJCV 2002»
13 years 6 months ago
Linear Multi View Reconstruction and Camera Recovery Using a Reference Plane
This paper presents a linear algorithm for simultaneous computation of 3D points and camera positions from multiple perspective views based on having a reference plane visible in a...
Carsten Rother, Stefan Carlsson
COLT
2010
Springer
13 years 4 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 1 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely