179 search results - page 11 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
105
click to vote
CSB
2005
IEEE
15 years 5 months ago
2005
IEEE
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
PR
2006
14 years 11 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
121
click to vote
SAC
2011
ACM
14 years 2 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
ADHOCNOW
2008
Springer
15 years 22 days ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...