Sciweavers

2626 search results - page 225 / 526
» The complexity of stochastic sequences
Sort
View
NIPS
1998
15 years 8 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
MOR
2006
79views more  MOR 2006»
15 years 6 months ago
The Value of Markov Chain Games with Lack of Information on One Side
We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Jérôme Renault
INFOCOM
2010
IEEE
15 years 4 months ago
Surfing the Blogosphere: Optimal Personalized Strategies for Searching the Web
We propose a distributed mechanism for finding websurfing strategies that is inspired by the StumbleUpon recommendation engine. Each day, a websurfer visits a sequence of websites ...
Stratis Ioannidis, Laurent Massoulié
JDCTA
2010
161views more  JDCTA 2010»
15 years 1 months ago
A Globally Consistent Solution to Multiview Image Registration
Multiview image registration is to compute the globally consistent transformations of a sequence of images. Due to various uncertainties, multiview image registration is considere...
Zezhong Xu
PAMI
2012
13 years 9 months ago
Spacetime Texture Representation and Recognition Based on a Spatiotemporal Orientation Analysis
—This paper is concerned with the representation and recognition of the observed dynamics (i.e., excluding purely spatial appearance cues) of spacetime texture based on a spatiot...
Konstantinos G. Derpanis, Richard P. Wildes