160 search results - page 19 / 32 » Similarity measurement on leaf-labelled trees |
127
Voted
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
150
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
145
Voted
WSC
2007
15 years 8 months ago
2007
This paper introduces an application and a methodology to predict future states of a process under real-time requirements. The real-time functionality is achieved by creating a Ba...
175
click to vote
ESWS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we present an adaptive, hybrid semantic matchmaker for SAWSDL services, called SAWSDL-MX2. It determines three kinds of semantic service similarity with a ...
159
click to vote
ICSM
2009
IEEE
16 years 22 days ago
2009
IEEE
Code clone management has been shown to have several benefits for software developers. When source code evolves, clone management requires a mechanism to efficiently and increme...