Sciweavers

1204 search results - page 172 / 241
» Hybrid Probabilistic Programs
Sort
View
ICRA
2006
IEEE
149views Robotics» more  ICRA 2006»
15 years 9 months ago
On Learning the Statistical Representation of a Task and Generalizing it to Various Contexts
— This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
Sylvain Calinon, Florent Guenter, Aude Billard
IFIP
2005
Springer
15 years 8 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
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 3 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»
15 years 3 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
PRL
2008
142views more  PRL 2008»
15 years 3 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