Sciweavers

3136 search results - page 28 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
15 years 7 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
WABI
2004
Springer
15 years 7 months ago
Novel Tree Edit Operations for RNA Secondary Structure Comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...
Julien Allali, Marie-France Sagot
ICPR
2002
IEEE
15 years 6 months ago
A Comparison of Techniques for Automatic Clustering of Handwritten Characters
This work reports experiments with four hierarchical clustering algorithms and two clustering indices for online handwritten characters. The main motivation of the work is to deve...
Vuokko Vuori, Jorma Laaksonen
COMPGEOM
2004
ACM
15 years 7 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
TC
2010
14 years 8 months ago
Performance Comparison of Graphics Processors to Reconfigurable Logic: A Case Study
A systematic approach to the comparison of the graphics processor (GPU) and reconfigurable logic is defined in terms of three throughput drivers. The approach is applied to five ca...
Ben Cope, Peter Y. K. Cheung, Wayne Luk, Lee W. Ho...