Sciweavers

13414 search results - page 2644 / 2683
» The distributed boosting algorithm
Sort
View
AI
2010
Springer
13 years 8 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
AI
2007
Springer
13 years 8 months ago
Learning action models from plan examples using weighted MAX-SAT
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
Qiang Yang, Kangheng Wu, Yunfei Jiang
ALMOB
2008
85views more  ALMOB 2008»
13 years 8 months ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...
ASE
2007
143views more  ASE 2007»
13 years 8 months ago
Composition inference for UML class diagrams
Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the ga...
Ana Milanova
BMCBI
2010
113views more  BMCBI 2010»
13 years 8 months ago
Unifying generative and discriminative learning principles
Background: The recognition of functional binding sites in genomic DNA remains one of the fundamental challenges of genome research. During the last decades, a plethora of differe...
Jens Keilwagen, Jan Grau, Stefan Posch, Marc Stric...
« Prev « First page 2644 / 2683 Last » Next »