A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Minimum cost subgraph matching using a binary linear program

2016
*
Pattern Recognition Letters
*

*Minimum*

*cost*

*subgraph*

*matching*

*using*

*a*

*binary*

*linear*

*program*. Pattern Recognition Letters, Elsevier, 2016, 71, pp. ... Abstract This article presents

*a*

*binary*

*linear*

*program*for the

*Minimum*

*Cost*

*Subgraph*

*Matching*(MCSM) problem. ... Our current works concern an embedded learning of the edit

*costs*, in order to get

*a*fully adaptive system. ...

##
###
A binary linear programming formulation of the graph edit distance

2006
*
IEEE Transactions on Pattern Analysis and Machine Intelligence
*

Then,

doi:10.1109/tpami.2006.152
pmid:16886857
fatcat:7lksfee56fhlvis3pwffuhftle
*a**binary**linear**program*is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the*binary**program*are derived by ... The*costs*associated with various edit operations are chosen by*using**a**minimum*normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. ... ACKNOWLEDGEMENTS This work was partially supported by*a*Dept. of EECS Graduate Fellowship to the first author and by the National Science Foundation under ITR contract CCR-0325571. ...##
###
Bicriteria Network Design Problems
[article]

1998
*
arXiv
*
pre-print

Finally, for the class of treewidth-bounded graphs, we provide pseudopolynomial-time algorithms for

arXiv:cs/9809103v1
fatcat:kgal233ohncypjtkchs3asiabu
*a*number of bicriteria problems*using*dynamic*programming*. ...*A*generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different*cost*functions), with*a*budget specified on the first, find*a*<*subgraph*\from*a*... Bodlaender for pointing out to*us*the equivalence between treewidth bounded graphs and decomposable graphs. We thank*A*. Ramesh for bringing [KP+93] to our attention. We also thank Dr. V. ...##
###
Setting Parameters by Example

2003
*
SIAM journal on computing (Print)
*

We describe algorithms for solving such problems for

doi:10.1137/s0097539700370084
fatcat:ztalubxlyfb63eh3akb3zrqyve
*minimum*spanning trees, shortest paths, and other "optimal*subgraph*" problems, and discuss applications in multicast routing, vehicle path planning, ... resource allocation, and board game*programming*. ... Instead, we take the same approach*used*for the other optimal*subgraph*problems, of*using*the ellipsoid method for*linear**programming*with*a*separation oracle. ...##
###
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching

2010
*
Journal of machine learning research
*

We develop

dblp:journals/jmlr/Schraudolph10
fatcat:jkzd6mciv5f6hkf6o77avic5ma
*a*new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect*matchings*into*a*novel technique for the exact computation of MAP states ... in hitherto intractable*binary*Markov random fields. ... Compute*a**minimum*-weight perfect*matching*M * (−θ) in the expanded dual with negated edge*costs*. ...##
###
Flexible graph matching and graph edit distance using answer set programming
[article]

2019
*
arXiv
*
pre-print

In this paper, we propose an approach based on answer set

arXiv:1911.11584v1
fatcat:kxlfpb4kabaizmj4vmnubefu24
*programming*. ... The graph isomorphism,*subgraph*isomorphism, and graph edit distance problems are combinatorial problems with many applications. ... variant*using**a**linear**programming*solver, and the second running with four threads. ...##
###
An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings

2012
*
Pattern Recognition
*

Our proposal to solve the problem of substitution-tolerant

doi:10.1016/j.patcog.2012.05.022
fatcat:xhhp2v3dpnfvrecbsvjb7xwb74
*subgraph*isomorphism relies on its formulation in the Integer*Linear**Program*(ILP) formalism. ... between the labels have*a*minimal*cost*. ... Integer*Linear**Programming*Solving*a*problem*using*ILP is*a*two-step process: it first requires*a*mathematical modelling of the problem as an integer*linear**program*. ...##
###
Binary Executable Files Homology Detection with Genetic Algorithm

2020
*
International Journal of Network Security
*

In this paper, we propose

dblp:journals/ijnsec/BianQ20
fatcat:sy565ajiw5eyzir6cvcygigj3e
*a*genetic algorithm to justify the*binary*code similarity. ... First of all, the*binary*executable files are converted into control flow graph , and then*use*genetic algorithm to compute the similarity among control flow graphs, which is regarded as the evaluation ... Acknowledgment This work is partially sponsored by National Key Research and Development*Program*of The authors gratefully appreciate the anonymous reviewers for their valuable comments. ...##
###
Page 9408 of Mathematical Reviews Vol. , Issue 2002M
[page]

2002
*
Mathematical Reviews
*

*Program*. 92 (2002), no. 1, Ser.

*A*, 1-36. This paper presents

*a*randomized procedure for rounding frac- tional perfect

*matchings*to (integral)

*matchings*. ... If the original fractional

*matching*satisfies any

*linear*inequality, then with high probability, the new

*matching*satisfies that

*linear*inequality in an approximate sense. ...

##
###
A Linear-Time Algorithm for Hamming Distance with Shifts

2007
*
Theory of Computing Systems
*

We present

doi:10.1007/s00224-007-9088-4
fatcat:rejgd4wptnedjgvtbp4m4i54km
*a**linear*-time algorithm for computing this distance. The previous best time bound was quadratic. ... The Hamming distance with shifts was introduced by Bookstein et al. as*a*generalization of the traditional Hamming distance to allow*a*tunable degree of fuzziness when comparing two*binary*sequences of ... Denote by*cost*[b] the*minimum**cost*of*a**matching*for the interval [1, b]. ...##
###
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins
[article]

2019
*
arXiv
*
pre-print

Our

arXiv:1903.02076v2
fatcat:svrnitxjcfaxhluryexcxcva6i
*cost*metric combines the*cost*of*binary*joins with*a*new*cost*metric called intersection-*cost*. ... Worst-case optimal plans evaluate queries by*matching*one query vertex at*a*time*using*multiway intersections. ... Our optimizer*uses**a**subgraph*catalogue to estimate i-*cost*, the*cost*of*binary*joins, and the number of partial*matches**a*plan will generate. ...##
###
A Fast Graph Program for Computing Minimum Spanning Trees

2020
*
Electronic Proceedings in Theoretical Computer Science
*

When

doi:10.4204/eptcs.330.10
fatcat:aasbm2oy5ng53jeffuypnkib7m
*using*graph transformation rules to implement graph algorithms,*a*challenge is to*match*the efficiency of*programs*in conventional languages. ... This is achieved*using*depth-first search as well as rooted graph transformation. The*program*is based on Boruvka's algorithm for*minimum*spanning trees. ...*A*challenge in rule-based graph*programming*is reaching the time efficiency of conventional*programs*due to the*cost*of graph*matching*. ...##
###
Balancing interconnect and computation in a reconfigurable computing array (or, why you don't really want 100% LUT utilization)

1999
*
Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays - FPGA '99
*

Also introduced in this work is an algorithm for "depopulating" the gates in

doi:10.1145/296399.296431
dblp:conf/fpga/DeHon99
fatcat:2bfb5ruwdjbtjdrrkbh2rgtkka
*a*hierarchical network to*match*the limited wiring resources. ... Rather, since interconnect resources consume most of the area on these devices (often 80-90%), we can achieve more area efficient designs by allowing some LUTs to go unused-allowing*us*to*use*the dominant ... Jason Cong's VLSI CAD Lab at UCLA provided the Flowmap implementation*used*to map LUTs here. ...##
###
Bicriteria Network Design Problems

1998
*
Journal of Algorithms
*

Bodlaender for pointing out to

doi:10.1006/jagm.1998.0930
fatcat:l2ibjbkydfcd7p2vedhtf72c7a
*us*the equivalence between treewidth bounded graphs and decomposable graphs. We wish to thank*A*. ... We also thank Dr.Vachaspati Kompella for making his other papers available to*us*. ... By*using**binary*search in [Cl,, Chi], we find*a*C' in this range such that (1) the algorithm*A*with c-*cost*bound C' returns*a**subgraph*from S with d-*cost*greater than p d . ...##
###
B-Matching for Spectral Clustering
[chapter]

2006
*
Lecture Notes in Computer Science
*

Instead of

doi:10.1007/11871842_67
fatcat:qzryyxp2xnf5baaak7nr3gejmi
*a*permutation matrix, it produces*a**binary*matrix with rows and columns summing to*a*positive integer b. ... Experiments on standard datasets, visualizations, and video data support the*use*of b-*matching*to prune graphs prior to spectral clustering. ... These constraints are unnecessary for bipartite*matching*since bipartite graphs don't have odd circuits. The Blossom algorithm*uses*the primal-dual method to solve the*linear**program*. ...
« Previous

*Showing results 1 — 15 out of 5,600 results*