Sciweavers

1830 search results - page 264 / 366
» Workshop on Graph Computation Models
Sort
View
152
Voted
UAI
2000
15 years 6 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 3 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
ICCV
2011
IEEE
14 years 5 months ago
Double Window Optimisation for Constant Time Visual SLAM
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
Hauke Strasdat, Andrew J. Davison, J. M. M. Montie...
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 21 days ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
151
Voted
CONCUR
2000
Springer
15 years 9 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...