Sciweavers

160 search results - page 22 / 32
» Similarity measurement on leaf-labelled trees
Sort
View
BMCBI
2006
137views more  BMCBI 2006»
13 years 8 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
CORR
1998
Springer
110views Education» more  CORR 1998»
13 years 7 months ago
Ultrametric Distance in Syntax
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
Mark D. Roberts
ICWS
2009
IEEE
14 years 5 months ago
Intelligent Matching for Public Internet Web Services Towards Semi-Automatic Internet Services Mashup
In this paper, we propose an Internet public Web service matching approach that paves the way for (semi-)automatic service mashup. We will first provide the overview of the soluti...
Chen Wu, Tharam S. Dillon, Elizabeth Chang
ECML
2004
Springer
14 years 1 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
ICDE
1992
IEEE
116views Database» more  ICDE 1992»
13 years 12 months ago
An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...
Mark Sullivan, Michael A. Olson