scispace - formally typeset
Journal ArticleDOI

Approximate graph edit distance computation by means of bipartite graph matching

Kaspar Riesen, +1 more
- 01 Jun 2009 - 
- Vol. 27, Iss: 7, pp 950-959
Reads0
Chats0
TLDR
A novel algorithm is introduced which allows us to approximately, or suboptimally, compute edit distance in a substantially faster way and is emprically verified that the accuracy of the suboptimal distance remains sufficiently accurate for various pattern recognition applications.
About
This article is published in Image and Vision Computing.The article was published on 2009-06-01. It has received 654 citations till now. The article focuses on the topics: Graph operations & Line graph.

read more

Citations
More filters

Pattern matching in massive metadata graphs at scale

TL;DR: This work presents design and implementation of distributed vertex-centric, asynchronous algorithms that guarantee a solution with full match enumeration in large-scale metadata graphs and designs solutions for distributed memory machines that address the two categories of matching problems.
BookDOI

Cryptology and Network Security

TL;DR: Wang et al. as mentioned in this paper proposed a SCARE based on Linear Regression Attack (LRA), which simultaneously detects and analyzes the power leakages of the secret encryption process, and further presented a complete SCARE flow with realistic power measurements of an unprotected software implementation.
Patent

Behavior variability and complexity modeling using a construction toy

TL;DR: In this article, a system includes a memory and a processor operatively coupled to the memory, with the processor being configured to execute instructions to monitor a behavior of a player of a first construction toy.
Proceedings ArticleDOI

Graph representation for content-based fMRI activation map retrieval

TL;DR: This work proposes a graph-based representation for brain activation maps with the goal of improving retrieval accuracy as compared to existing methods and evaluated the approach using human subject data obtained from eight experiments where a variety of stimuli were applied.
Book ChapterDOI

Variational Method for Computing Average Images of Biological Organs

TL;DR: A variational method for the computation of average images of biological organs in three-dimensional Euclidean space using the diffusion registration technique and optical flow computation to define the average as the shape which minimises the total deformation.
References
More filters
Journal ArticleDOI

The Protein Data Bank

TL;DR: The goals of the PDB are described, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource are described.
Journal ArticleDOI

The Hungarian method for the assignment problem

TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Journal ArticleDOI

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Related Papers (5)