Sciweavers

220 search results - page 25 / 44
» Learning probabilistic decision graphs
Sort
View
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
ICCV
2005
IEEE
14 years 1 months ago
Perceptual Scale Space and its Applications
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
Yizhou Wang, Siavosh Bahrami, Song Chun Zhu
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
NAACL
2007
13 years 9 months ago
OMS-J: An Opinion Mining System for Japanese Weblog Reviews Using a Combination of Supervised and Unsupervised Approaches
We introduce a simple opinion mining system for analyzing Japanese Weblog reviews called OMS-J. OMS-J is designed to provide an intuitive visual GUI of opinion mining graphs for a...
Guangwei Wang, Kenji Araki
ICTAI
2009
IEEE
14 years 2 months ago
EBLearn: Open-Source Energy-Based Learning in C++
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
Pierre Sermanet, Koray Kavukcuoglu, Yann LeCun