The following pages link to Horst Bunke (Q632591):
Displaying 50 items.
- (Q237058) (redirect page) (← links)
- Recent advances in graph-based pattern recognition with applications in document analysis (Q632592) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Combining diverse on-line and off-line systems for handwritten text line recognition (Q733072) (← links)
- Matching graphs with unique node labels (Q851709) (← links)
- Automatic learning of cost functions for graph edit distance (Q867614) (← links)
- Hidden Markov model-based ensemble methods for offline handwritten text line recognition (Q941591) (← links)
- Generalized median graph computation by means of graph embedding in vector spaces (Q962746) (← links)
- On the generative power of sequential and parallel programmed graph grammars (Q1163378) (← links)
- On the coding of ordered graphs (Q1266307) (← links)
- Acquisition of 2D shape models from scenes with overlapping objects using string matching (Q1294711) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- The IAM-database: An English sentence database for offline handwriting recognition (Q1403069) (← links)
- On the minimum common supergraph of two graphs (Q1583672) (← links)
- Optimal vertex ordering of graphs (Q1607014) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees (Q1860118) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- Detection of rotational and involutional symmetries and congruity of polyhedra (Q1914975) (← links)
- Optimal implementation of morphological operations on neighborhood-connected parallel computers (Q1924774) (← links)
- Discriminative prototype selection methods for graph embedding (Q1951277) (← links)
- Lipreading using signal analysis over time (Q1960497) (← links)
- Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning (Q2369587) (← links)
- A writer identification system for on-line whiteboard data (Q2427372) (← links)
- A graph-theoretic approach to enterprise network dynamics. (Q2432941) (← links)
- Fuzzy timed Petri nets - analysis and implementation (Q2473102) (← links)
- Fuzzy timed Petri net definitions, properties, and applications (Q2486809) (← links)
- Edit distance-based kernel functions for structural pattern classification (Q2498678) (← links)
- Using fuzzy logic to match strings in documents (Q2739005) (← links)
- (Q2763396) (← links)
- (Q2775912) (← links)
- (Q2777466) (← links)
- (Q2906538) (← links)
- Dimensionality Reduction for Graph of Words Embedding (Q3003441) (← links)
- Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching (Q3003453) (← links)
- (Q3046302) (← links)
- (Q3047460) (← links)
- Approximation of Graph Edit Distance in Quadratic Time (Q3300141) (← links)
- Comparing representative selection strategies for dissimilarity representations (Q3423160) (← links)
- (Q3464592) (← links)
- Graph Classification and Clustering Based on Vector Space Embedding (Q3557987) (← links)
- A Recursive Embedding Approach to Median Graph Computation (Q3637694) (← links)
- Efficient Suboptimal Graph Isomorphism (Q3637695) (← links)
- Improving Graph Classification by Isomap (Q3637702) (← links)
- (Q3673151) (← links)
- (Q3799652) (← links)
- (Q3873565) (← links)