NIPS
2004
14 years 6 days ago
2004
A generative probabilistic model for objects in images is presented. An object consists of a constellation of features. Feature appearance and pose are modeled probabilistically. ...
FMOODS
2003
14 years 6 days ago
2003
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...
IWPT
2001
14 years 6 days ago
2001
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which ...
LANMR
2004
14 years 6 days ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
IWEC
2004
14 years 6 days ago
2004
In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types 0 . . .
AIPS
2006
14 years 7 days ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
AAAI
2008
14 years 1 months ago
2008
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...
AAAI
2008
14 years 1 months ago
2008
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
SIGIR
1995
ACM
14 years 2 months ago
1995
ACM
We analyse the kinematics of probabilistic term weights at retrieval time for di erent Information Retrieval models. We present four models based on di erent notions of probabilis...
WDAG
2000
Springer
14 years 2 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...