Horst Bunke

From MaRDI portal
Person:632591

Available identifiers

zbMath Open bunke.horstMaRDI QIDQ632591

List of research outcomes





PublicationDate of PublicationType
Improved Graph Edit Distance Approximation with Simulated Annealing2022-06-15Paper
Approximation of Graph Edit Distance in Quadratic Time2020-07-27Paper
Improving bipartite graph edit distance approximation using various search strategies2017-11-20Paper
Efficient subgraph matching using topological node feature constraints2017-11-10Paper
Approximation of graph edit distance based on Hausdorff matching2017-11-10Paper
https://portal.mardi4nfdi.de/entity/Q34645922016-01-27Paper
Discriminative prototype selection methods for graph embedding2013-06-04Paper
A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection2013-05-28Paper
A Novel Software Toolkit for Graph Edit Distance Computation2013-05-28Paper
A Fast Matching Algorithm for Graph-Based Handwriting Recognition2013-05-28Paper
An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs2013-05-28Paper
Graph edit distance -- optimal and suboptimal algorithms with applications2012-09-05Paper
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching2011-05-27Paper
Dimensionality Reduction for Graph of Words Embedding2011-05-27Paper
Recent advances in graph-based pattern recognition with applications in document analysis2011-03-25Paper
Graph Classification and Clustering Based on Vector Space Embedding2010-04-29Paper
Generalized median graph computation by means of graph embedding in vector spaces2010-04-07Paper
Combining diverse on-line and off-line systems for handwritten text line recognition2009-10-15Paper
Graph Embedding in Vector Spaces by Means of Prototype Selection2009-07-24Paper
Bipartite Graph Matching for Computing the Edit Distance of Graphs2009-07-24Paper
A Quadratic Programming Approach to the Graph Edit Distance Problem2009-07-24Paper
A Recursive Embedding Approach to Median Graph Computation2009-07-14Paper
Efficient Suboptimal Graph Isomorphism2009-07-14Paper
Improving Graph Classification by Isomap2009-07-14Paper
Hidden Markov model-based ensemble methods for offline handwritten text line recognition2008-09-01Paper
A writer identification system for on-line whiteboard data2008-05-09Paper
Fuzzy timed Petri nets - analysis and implementation2008-02-26Paper
Bridging the Gap between Graph Edit Distance and Kernel Machines2007-08-21Paper
Comparing representative selection strategies for dissimilarity representations2007-02-20Paper
Automatic learning of cost functions for graph edit distance2007-02-16Paper
Matching graphs with unique node labels2006-11-22Paper
A graph-theoretic approach to enterprise network dynamics.2006-10-26Paper
Edit distance-based kernel functions for structural pattern classification2006-08-16Paper
Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning2006-05-22Paper
Graph-Based Representations in Pattern Recognition2005-09-13Paper
Graph-Based Representations in Pattern Recognition2005-09-13Paper
Graph-Based Representations in Pattern Recognition2005-09-13Paper
Graph-Based Representations in Pattern Recognition2005-09-13Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
Fuzzy timed Petri net definitions, properties, and applications2005-08-17Paper
Graph-Theoretic Techniques for Web Content Mining2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q48089322004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48089352004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30474602004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48089372004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30463022004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47365332004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44483032004-02-17Paper
https://portal.mardi4nfdi.de/entity/Q44508102004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44507972004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44507952004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44508052004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44507852004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44507932004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44364152003-12-04Paper
The IAM-database: An English sentence database for offline handwriting recognition2003-08-31Paper
Validation indices for graph clustering2003-07-29Paper
Using attributed plex grammars for the generation of image and graph databases2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q47905062003-06-02Paper
Investigating Anytime Algorithms for Future Distance Warning Systems2003-04-03Paper
Video indexing and similarity retrieval by largest common subgraph detection using decision trees2003-02-20Paper
Video sequence matching via decision tree path following2003-02-20Paper
https://portal.mardi4nfdi.de/entity/Q47803472002-11-19Paper
Optimal vertex ordering of graphs2002-07-25Paper
Self-organizing map for clustering in the graph domain2002-07-03Paper
https://portal.mardi4nfdi.de/entity/Q45364952002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q45317692002-05-23Paper
Weighted mean of a pair of graphs2002-03-20Paper
https://portal.mardi4nfdi.de/entity/Q27774662002-03-07Paper
Rule-based fuzzy object similarity2002-02-28Paper
https://portal.mardi4nfdi.de/entity/Q27633962002-01-15Paper
Using fuzzy logic to match strings in documents2001-09-09Paper
On the minimum common supergraph of two graphs2001-06-28Paper
A fuzzy information space approach to speech signal non-linear analysis2000-07-09Paper
Lipreading using signal analysis over time2000-01-12Paper
Acquisition of 2D shape models from scenes with overlapping objects using string matching1999-09-23Paper
On the coding of ordered graphs1999-05-09Paper
https://portal.mardi4nfdi.de/entity/Q42185031998-11-11Paper
Finding rotational symmetries by cyclic string matching1998-10-21Paper
A graph distance metric based on the maximal common subgraph1998-10-13Paper
Classes of cost functions for string edit distance1997-05-28Paper
An improved algorithm for computing the edit distance of run-length coded strings1997-02-28Paper
Optimal implementation of morphological operations on neighborhood-connected parallel computers1997-01-14Paper
Detection of rotational and involutional symmetries and congruity of polyhedra1996-09-29Paper
Fast approximate matching of words against a dictionary1995-09-17Paper
Segmentation of the needle map of objects with curved surfaces1994-10-30Paper
An optimal algorithm for extracting the regions of a plane graph1994-01-02Paper
An algorithm for matching run-length coded strings1993-12-20Paper
https://portal.mardi4nfdi.de/entity/Q46947481993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q46947271993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q46926511993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40409461993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40357501993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q37996521987-01-01Paper
Inexact graph matching for structural pattern recognition1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36731511983-01-01Paper
Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation1982-01-01Paper
On the generative power of sequential and parallel programmed graph grammars1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38735651979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41916161979-01-01Paper

Research outcomes over time

This page was built for person: Horst Bunke