Suche
Anzeige der Einträge 31-40 von 69
Kernel k-means Clustering applied to Vector Space Embeddings of Graphs
(Springer, 2008)
Artificial Neural Networks in Pattern Recognition. Third IAPR TC3 Workshop, ANNPR 2008 Paris, France, July 2-4, 2008, Proceedings
04B - Beitrag Konferenzschrift
Discriminative Prototype Selection Methods for Graph Embedding
(2013)
Pattern Recognition
01 - Zeitschriftenartikel, Journalartikel oder Magazin
Approximation of graph edit distance based on Hausdorff matching
(2015)
Pattern Recognition
01A - Beitrag in wissenschaftlicher Zeitschrift
Graph Based Keyword Spotting in Handwritten Historical Slavic Documents
(2013)
ERCIM News
01 - Zeitschriftenartikel, Journalartikel oder Magazin
Dissimilarity based Vector Space Embedding of Graphs using Prototype Reduction Schemes
(Springer, 2009)
Machine Learning and Data Mining in Pattern Recognition. 6th International Conference, MLDM 2009, Leipzig, Germany, July 23-25, 2009, Proceedings
04B - Beitrag Konferenzschrift
Efficient Suboptimal Graph Isomorphism
(Springer, 2009)
Graph-Based Representations in Pattern Recognition. 7th IAPR-TC-15 International Workshop, GbRPR 2009, Venice, Italy, May 26-28, 2009. Proceedings
04B - Beitrag Konferenzschrift
Towards the Unification of Structural and Statistical Pattern Recognition
(2012)
Proceedings of the 2nd International Conference on Research in Air Transportation, ICRAT
04B - Beitrag Konferenzschrift
Structural Pattern Recognition with Graph Edit Distance - Approximation Algorithms and Applications
(Springer, 2016)
02 - Monographie
Exact and Inexact Graph Matching: Methodology and Applications
(Springer, 2010)
Managing and mining graph data
04 - Beitrag Sammelband oder Konferenzschrift
Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time
(Springer, 2014)
Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. Proceedings
Exact computation of graph edit distance (GED) can be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment ...
04B - Beitrag Konferenzschrift