Sciweavers

5398 search results - page 261 / 1080
» Markov Face Models
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 6 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
WWW
2011
ACM
15 years 1 months ago
Web information extraction using Markov logic networks
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...
Sandeepkumar Satpal, Sahely Bhadra, Sundararajan S...
INTERACT
2007
15 years 8 months ago
Face-to-Face Sociability Signs Made Explicit in CMC
This paper discusses how semiotic engineering can support the formulation of problems and solutions involved in handling face-to-face (F2F) sociability models in computer-mediated ...
Carla Faria Leitão, Clarisse Sieckenius de ...
CVPR
2012
IEEE
13 years 8 months ago
A Unified Framework for Event Summarization and Rare Event Detection
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Junseok Kwon and Kyoung Mu Lee