( en | de | ru )

 

Disambiguation of "Serratosa, Francesc"

Author of the publication

copydeleteadd this publication to your clipboard
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching.

, , and . GbRPR, volume 9069 of Lecture Notes in Computer Science, page 77-86. Springer, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

Jordi Serratosa

Francesc Pont

Francesc Xavier Camps Camprubí

Francesc Vilanova i Vila-abadal

 

Other publications of authors with the same name

A Fast and Exact Modulo-Distance Between Histograms., and . SSPR/SPR, volume 4109 of Lecture Notes in Computer Science, page 394-402. Springer, (2006)A Graph Repository for Learning Error-Tolerant Graph Matching., , and . S+SSPR, volume 10029 of Lecture Notes in Computer Science, page 519-529. (2016)Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling., and . GbRPR, volume 7877 of Lecture Notes in Computer Science, page 61-70. Springer, (2013)Generalized median graph computation by means of graph embedding in vector spaces., , , , and . Pattern Recognit., 43 (4): 1642-1655 (2010)A Probabilistic Framework to Obtain a Common Labelling between Attributed Graphs., and . IbPRIA, volume 6669 of Lecture Notes in Computer Science, page 516-523. Springer, (2011)A New Algorithm to Compute the Distance Between Multi-dimensional Histograms., , and . CIARP, volume 4756 of Lecture Notes in Computer Science, page 115-123. Springer, (2007)Computing the graph edit distance using dominant sets., , , and . ICPR, page 1080-1083. IEEE Computer Society, (2012)Improving the matching of graphs generated from shapes by the use of procrustes distances into a clique-based MAP formulation., , and . ICPR, page 1-4. IEEE Computer Society, (2008)On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance., , and . S+SSPR, volume 10029 of Lecture Notes in Computer Science, page 121-131. (2016)Learning Graph Matching Substitution Weights based on a Linear Regression., and . ICPR, page 53-58. IEEE, (2020)