Sciweavers

1199 search results - page 20 / 240
» Robust inference of trees
Sort
View
HYBRID
2009
Springer
14 years 4 months ago
Distributed Tree Rearrangements for Reachability and Robust Connectivity
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
Michael Schuresko, Jorge Cortés
RT
2001
Springer
14 years 2 months ago
Realistic Reflections and Refractions on Graphics Hardware with Hybrid Rendering and Layered Environment Maps
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
Ziyad S. Hakura, John M. Snyder
UAI
2008
13 years 11 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
FLAIRS
2006
13 years 11 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
LPNMR
2009
Springer
14 years 2 months ago
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...
Esra Erdem