Sciweavers

924 search results - page 117 / 185
» Incremental Probabilistic Inference
Sort
View
TPDS
2010
142views more  TPDS 2010»
15 years 26 days ago
Toward Optimal Network Fault Correction in Externally Managed Overlay Networks
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
125
Voted
AAAI
2011
14 years 2 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
142
Voted
AAAI
2011
14 years 2 months ago
Understanding Natural Language Commands for Robotic Navigation and Mobile Manipulation
This paper describes a new model for understanding natural language commands given to autonomous systems that perform navigation and mobile manipulation in semi-structured environ...
Stefanie Tellex, Thomas Kollar, Steven Dickerson, ...
141
Voted
ACL
2012
13 years 4 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
116
Voted
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
15 years 9 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel