Sciweavers

317 search results - page 26 / 64
» Computing and Updating the Process Number in Trees
Sort
View
WEA
2007
Springer
114views Algorithms» more  WEA 2007»
15 years 7 months ago
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
CIKM
2005
Springer
15 years 7 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
15 years 7 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 5 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 7 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv