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.

 

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

Learning Graph Matching Substitution Weights based on a Linear Regression., и . ICPR, стр. 53-58. IEEE, (2020)A New Algorithm to Compute the Distance Between Multi-dimensional Histograms., , и . CIARP, том 4756 из Lecture Notes in Computer Science, стр. 115-123. Springer, (2007)Generalized median graph computation by means of graph embedding in vector spaces., , , , и . Pattern Recognit., 43 (4): 1642-1655 (2010)A Probabilistic Framework to Obtain a Common Labelling between Attributed Graphs., и . IbPRIA, том 6669 из Lecture Notes in Computer Science, стр. 516-523. Springer, (2011)Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling., и . GbRPR, том 7877 из Lecture Notes in Computer Science, стр. 61-70. Springer, (2013)A Fast and Exact Modulo-Distance Between Histograms., и . SSPR/SPR, том 4109 из Lecture Notes in Computer Science, стр. 394-402. Springer, (2006)A Graph Repository for Learning Error-Tolerant Graph Matching., , и . S+SSPR, том 10029 из Lecture Notes in Computer Science, стр. 519-529. (2016)K-nn Queries in Graph Databases Using M-Trees., , и . CAIP (1), том 6854 из Lecture Notes in Computer Science, стр. 202-210. Springer, (2011)Modelling Intermittently Present Features Using Nonlinear Point Distribution Models., и . PSIVT, том 4872 из Lecture Notes in Computer Science, стр. 260-273. Springer, (2007)On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance., , и . S+SSPR, том 10029 из Lecture Notes in Computer Science, стр. 121-131. (2016)