11 search results - page 2 / 3 » Efficient Lifting for Online Probabilistic Inference |
IJCAI
2003
13 years 6 months ago
2003
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
JCDL
2006
ACM
13 years 11 months ago
2006
ACM
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...