From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Edit Distance Based Kernel Functions for Attributed Graph Matching., и . GbRPR, том 3434 из Lecture Notes in Computer Science, стр. 352-361. Springer, (2005)A Random Walk Kernel Derived from Graph Edit Distance., и . SSPR/SPR, том 4109 из Lecture Notes in Computer Science, стр. 191-199. Springer, (2006)Bridging the Gap between Graph Edit Distance and Kernel Machines, и . Series in Machine Perception and Artificial Intelligence WorldScientific, (2007)Fast Suboptimal Algorithms for the Computation of Graph Edit Distance., , и . SSPR/SPR, том 4109 из Lecture Notes in Computer Science, стр. 163-172. Springer, (2006)Graph Embedding in Vector Spaces by Means of Prototype Selection., , и . GbRPR, том 4538 из Lecture Notes in Computer Science, стр. 383-393. Springer, (2007)An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification., и . SSPR/SPR, том 3138 из Lecture Notes in Computer Science, стр. 180-189. Springer, (2004)Transforming Strings to Vector Spaces Using Prototype Selection., , , , и . SSPR/SPR, том 4109 из Lecture Notes in Computer Science, стр. 287-296. Springer, (2006)Graph Matching - Challenges and Potential Solutions., , и . ICIAP, том 3617 из Lecture Notes in Computer Science, стр. 1-10. Springer, (2005)Edit distance-based kernel functions for structural pattern classification., и . Pattern Recognit., 39 (10): 1852-1863 (2006)A Probabilistic Approach to Learning Costs for Graph Edit Distance., и . ICPR (3), стр. 389-393. IEEE Computer Society, (2004)