Approximate graph matching using probabilistic hill climbing algorithms
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 390-396
- https://doi.org/10.1109/tai.1994.346466
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Nested segmentation: an approach for layout analysis in document classificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A tool for classifying office documentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A tool for tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Combinatorial pattern discovery for scientific dataACM SIGMOD Record, 1994
- Exact and approximate algorithms for unordered tree matchingIEEE Transactions on Systems, Man, and Cybernetics, 1994
- Approximate Tree Matching in the Presence of Variable Length Don′t CaresJournal of Algorithms, 1994
- A system for approximate tree matchingIEEE Transactions on Knowledge and Data Engineering, 1994
- Randomized algorithms for optimizing large join queriesPublished by Association for Computing Machinery (ACM) ,1990
- Simulated annealing and combinatorial optimizationPublished by Association for Computing Machinery (ACM) ,1986
- Optimization by Simulated AnnealingScience, 1983