Amanote Research

Amanote Research

    RegisterSign In

Matching Hierarchical Structures Using Association Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0054730
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1998

Authors
Marcello PelilloKaleem SiddiqiSteven W. Zucker
Publisher

Springer Berlin Heidelberg


Related search

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering
Computational MechanicsComputer Science Applications
2019English

An Algebra of Hierarchical Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Similarity Measures in Documents Using Association Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

IEEE Transactions on Neural Networks and Learning Systems
Computer NetworksSoftwareComputer Science ApplicationsArtificial IntelligenceCommunications
2019English

Exploratory Analysis of Protein Translation Regulatory Networks Using Hierarchical Random Graphs

2009English

Matching Dominating Sets of Interval Graphs

International Journal of Computer Applications
2014English

Hierarchical Matching of Non-Rigid Shapes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Efficient Matching of Dynamically Changing Graphs

Theory and Applications of Image Analysis
1992English

Matching and Stable Cutsets in Graphs.

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy