Sciweavers

312 search results - page 32 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
AI
2010
Springer
13 years 7 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
DASFAA
2008
IEEE
139views Database» more  DASFAA 2008»
13 years 9 months ago
Exploiting ID References for Effective Keyword Search in XML Documents
In this paper, we study novel Tree + IDREF data model for keyword search in XML. In this model, we propose novel Lowest Referred Ancestor (LRA) pair, Extended LRA (ELRA) pair and E...
Bo Chen, Jiaheng Lu, Tok Wang Ling
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
WWW
2005
ACM
14 years 8 months ago
Algorithmic detection of semantic similarity
Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic meas...
Ana Gabriela Maguitman, Filippo Menczer, Heather R...
RECOMB
2009
Springer
14 years 8 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....