Sciweavers

220 search results - page 21 / 44
» Learning probabilistic decision graphs
Sort
View
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet
CVPR
2008
IEEE
14 years 9 months ago
3D occlusion recovery using few cameras
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
Mark A. Keck, James W. Davis
JCB
2006
185views more  JCB 2006»
13 years 7 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
BMCBI
2010
229views more  BMCBI 2010»
13 years 7 months ago
Mocapy++ - A toolkit for inference and learning in dynamic Bayesian networks
Background: Mocapy++ is a toolkit for parameter learning and inference in dynamic Bayesian networks (DBNs). It supports a wide range of DBN architectures and probability distribut...
Martin Paluszewski, Thomas Hamelryck
OTM
2010
Springer
13 years 5 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang