Sciweavers

494 search results - page 66 / 99
» Probabilistic Programming in Anglican
Sort
View
IFIP
2005
Springer
15 years 3 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
97
Voted
CORR
2008
Springer
154views Education» more  CORR 2008»
14 years 10 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
JEI
2006
162views more  JEI 2006»
14 years 10 months ago
Markovian segmentation and parameter estimation on graphics hardware
In this paper, we show how Markovian strategies used to solve well-known segmentation problems such as motion estimation, motion detection, motion segmentation, stereovision, and c...
Pierre-Marc Jodoin, Max Mignotte
75
Voted
PRL
2008
142views more  PRL 2008»
14 years 10 months ago
Highly accurate error-driven method for noun phrase detection
We present a new model for detection of noun phrases in unrestricted text, whose most outstanding feature is its flexibility: the system is able to recognize noun phrases similar ...
Lourdes Araujo, Jose Ignacio Serrano
RAS
2010
117views more  RAS 2010»
14 years 8 months ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...