Sciweavers

160 search results - page 19 / 32
» Similarity measurement on leaf-labelled trees
Sort
View
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
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...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
14 years 2 days ago
On the Multiple Gene Duplication Problem
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...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
WSC
2007
13 years 10 months ago
Real-time prediction in a stochastic domain via similarity-based data-mining
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...
Timo Steffens, Philipp Hügelmeyer
ESWS
2009
Springer
13 years 11 months ago
Hybrid Adaptive Web Service Selection with SAWSDL-MX and WSDL-Analyzer
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 ...
Matthias Klusch, Patrick Kapahnke, Ingo Zinnikus
ICSM
2009
IEEE
14 years 2 months ago
Scalable and incremental clone detection for evolving software
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...
Tung Thanh Nguyen, Hoan Anh Nguyen, Jafar M. Al-Ko...