Sciweavers

864 search results - page 54 / 173
» A general markov framework for page importance computation
Sort
View
PPOPP
2005
ACM
14 years 2 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
ICVGIP
2004
13 years 10 months ago
A Robust Nonparametric Estimation Framework for Implicit Image Models
Robust model fitting is important for computer vision tasks due to the occurrence of multiple model instances, and, unknown nature of noise. The linear errors-in-variables (EIV) m...
Himanshu Arora, Maneesh Singh, Narendra Ahuja
FLAIRS
2008
13 years 11 months ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
ATAL
2010
Springer
13 years 10 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
JAIR
2008
130views more  JAIR 2008»
13 years 9 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...