866 search results - page 45 / 174 » Algorithms for Comparing Pedigree Graphs |
161
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
123
Voted
FLAIRS
2000
15 years 4 months ago
2000
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
123
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
127
Voted
DAWAK
2007
Springer
15 years 9 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
126
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...