1056 search results - page 125 / 212 » Constraint-Based Graph Matching |
CPM
1994
Springer
14 years 1 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
ESA
1994
Springer
14 years 1 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
TCS
2008
13 years 9 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
CPHYSICS
2011
13 years 21 days ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...