Auflistung nach Autor/Autorin "Riesen, Kaspar"
Anzeige der Einträge 1-20 von 70
-
A Family of Novel Graph Kernels for Structural Pattern Recognition
(2007)Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications04B - Beitrag Konferenzschrift -
A Fast Matching Algorithm for Graph-Based Handwriting Recognition
(2013)Graph-Based Representations in Pattern Recognition04B - Beitrag Konferenzschrift -
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
(2015)Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015.In recent years, a powerful approximation framework for graph edit distance computation has been introduced. This particular approximation is based on an optimal assignment of local graph structures which can be established ...04B - Beitrag Konferenzschrift -
A Graph-Based Recommender for Enhancing the Assortment of Web Shops
(2015)Proceedings of Workshop on Data Mining in Marketing DMM'2015In this work, we consider a situation where multiple Providers (competitors) serve a common market, using a common infrastructure of sales channels. More speci cally, we focus on multiple web shops that are run by the same ...04B - Beitrag Konferenzschrift -
A Novel Graph Database for Handwritten Word Images
(2016)S+SSPR04 - Beitrag Sammelband oder Konferenzschrift -
A Novel Software Toolkit for Graph Edit Distance Computation
(2013-05-17)Proceedings of the 9th IAPR-TC-15 International Workshop04B - Beitrag Konferenzschrift -
An Approximate Algorithm for Median Graph Computation using Graph Embedding
(2008)Proc. 19th Int. Conf. on Pattern Recognition, IEEE04B - Beitrag Konferenzschrift -
An Experimental Study of Graph Classification using Prototype Selection
(2008)Proc. 19th Int. Conf. on Pattern Recognition, IEEE04B - Beitrag Konferenzschrift -
Approximate Graph Edit Distance Computation by means of Bipartite Graph Matching
(2009)Image and Vision Computing01 - Zeitschriftenartikel, Journalartikel oder Magazin -
Approximation of graph edit distance based on Hausdorff matching
(2015)Pattern Recognition01A - Beitrag in wissenschaftlicher Zeitschrift -
Approximation of Graph Edit Distance by Means of a Utility Matrix
(2016)Artificial neural networks in pattern recognition : 7th IAPR TC3 Workshop, ANNPR 2016, Proceedings04B - Beitrag Konferenzschrift -
Approximation of Graph Edit Distance in Quadratic Time
(2015-05)Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015.The basic idea of a recent graph matching framework is to reduce the problem of graph edit distance (GED) to an instance of a linear sum assignment problem (LSAP). The optimal solution for this simplified GED problem can ...04B - Beitrag Konferenzschrift -
Bipartite Graph Matching for Computing the Edit Distance of Graphs
(2007)Proc. 6th Int. Workshop on Graph Based Representations in Pattern Recognition04B - Beitrag Konferenzschrift -
Building Classifier Ensembles Using Greedy Graph Edit Distance
(2015)Multiple Classifier Systems - 12th International Workshop, MCS 2015, Günzburg, Germany, June 29 - July 1, 2015Classifier ensembles aim at more accurate classifications than single classifiers. In the present paper we introduce a general approach to building structural classifier ensembles, i.e. classifiers that make use of graphs ...04B - Beitrag Konferenzschrift -
Classification and Clustering of Vector Space Embedded Graphs
(2011)Emerging Topics in Computer Vision and its Applications04 - Beitrag Sammelband oder Konferenzschrift -
Classifier Ensembles for Vector Space Embedding of Graphs
(2007)Proc. 7th Int. Workshop on Multiple Classifier Systems04B - Beitrag Konferenzschrift -
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
(2014)Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014, ProceedingsGraph edit distance (GED) is a powerful and flexible graph dissimilarity model. Yet, exact computation of GED is an instance of a quadratic assignment problem and can thus be solved in exponential time complexity only. A ...04B - Beitrag Konferenzschrift -
Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time
(2014)Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. ProceedingsExact 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 -
Discriminative Prototype Selection Methods for Graph Embedding
(2013)Pattern Recognition01 - Zeitschriftenartikel, Journalartikel oder Magazin
