Sciweavers

786 search results - page 53 / 158
» Network Inference from Co-Occurrences
Sort
View
UAI
2008
13 years 11 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
ATAL
2005
Springer
14 years 3 months ago
Task inference and distributed task management in the Centibots robotic system
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...
Charlie Ortiz, Régis Vincent, Benoit Moriss...
NSDI
2008
14 years 6 hour ago
Effective Diagnosis of Routing Disruptions from End Systems
Internet routing events are known to introduce severe disruption to applications. So far effective diagnosis of routing events has relied on proprietary ISP data feeds, resulting ...
Ying Zhang, Zhuoqing Morley Mao, Ming Zhang
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
14 years 3 months ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
IJAR
2010
152views more  IJAR 2010»
13 years 8 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...