( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation.

, , и . ANNPR, том 8774 из Lecture Notes in Computer Science, стр. 117-128. Springer, (2014)

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.

Dirk Riesen

Walter Riesen

Cornelius Riesen

Katharina Riesen

Erwin Riesen

 

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

Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic., , и . MLG, (2007)Cross-Evaluation of Graph-Based Keyword Spotting in Handwritten Historical Documents., , , и . GbRPR, том 11510 из Lecture Notes in Computer Science, стр. 45-55. Springer, (2019)Graph Based Keyword Spotting in Handwritten Historical Slavic Documents., и . ERCIM News, (2013)Graph-Based Offline Signature Verification., , , , и . CoRR, (2019)Approximate graph edit distance computation by means of bipartite graph matching., и . Image Vis. Comput., 27 (7): 950-959 (2009)Discriminative prototype selection methods for graph embedding., , , и . Pattern Recognit., 46 (6): 1648-1657 (2013)Improving bipartite graph edit distance approximation using various search strategies., и . Pattern Recognit., 48 (4): 1349-1363 (2015)A comparative study of pattern recognition algorithms for predicting the inpatient mortality risk using routine laboratory measurements., , и . Artif. Intell. Rev., 52 (4): 2559-2573 (2019)Graph-based keyword spotting in historical manuscripts using Hausdorff edit distance., , , , и . Pattern Recognit. Lett., (2019)A Family of Novel Graph Kernels for Structural Pattern Recognition., и . CIARP, том 4756 из Lecture Notes in Computer Science, стр. 20-31. Springer, (2007)