( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Automatic learning of cost functions for graph edit distance.

, и . Inf. Sci., 177 (1): 239-247 (2007)

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.

Michel Georg Michel

Stephan Neuhaus

Kathrin Neuhaus

Christian Neuhaus

Gerold Neuhaus

 

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

Edit Distance Based Kernel Functions for Attributed Graph Matching., и . GbRPR, том 3434 из Lecture Notes in Computer Science, стр. 352-361. Springer, (2005)Similarity Measures For Hierarchical Representations Of Graphs With Unique Node Labels., , , , и . IJPRAI, 18 (3): 425-442 (2004)A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance., и . AVBPA, том 3546 из Lecture Notes in Computer Science, стр. 191-200. Springer, (2005)Bridging the Gap between Graph Edit Distance and Kernel Machines, и . Series in Machine Perception and Artificial Intelligence WorldScientific, (2007)A Random Walk Kernel Derived from Graph Edit Distance., и . SSPR/SPR, том 4109 из Lecture Notes in Computer Science, стр. 191-199. Springer, (2006)Automatic learning of cost functions for graph edit distance., и . Inf. Sci., 177 (1): 239-247 (2007)Self-organizing maps for learning the edit costs in graph matching., и . IEEE Trans. Syst. Man Cybern. Part B, 35 (3): 503-514 (2005)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)A Quadratic Programming Approach to the Graph Edit Distance Problem., и . GbRPR, том 4538 из Lecture Notes in Computer Science, стр. 92-102. Springer, (2007)