{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-matching/papers/5","list_of":"/task/graph-matching","task":"Graph Matching","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,477],"of":477,"counts":{"archive_papers_tagged":477,"with_a_code_link":163,"where_syntology_ran_a_sample":35,"not_listed_spam_title":0,"listed":477,"listed_where_code_ran":35,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":27,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":27,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-matching","prev":"/task/graph-matching/papers/4","next":null,"papers":[{"url":null,"slug":"ds-tighter-lifting-free-convex-relaxations","title":"DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems","date":"2017-11-29","arxiv_id":"1711.10733","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-cuts-and-matching-of-partitions-in-one","title":"Joint Cuts and Matching of Partitions in One Graph","date":"2017-11-27","arxiv_id":"1711.09584","repositories_listed":0,"syntology":null},{"url":"/paper/dynamic-label-graph-matching-for-unsupervised","slug":"dynamic-label-graph-matching-for-unsupervised","title":"Dynamic Label Graph Matching for Unsupervised Video Re-Identification","date":"2017-09-27","arxiv_id":"1709.09297","repositories_listed":0,"syntology":null},{"url":null,"slug":"motion-appearance-interactive-encoding-for","title":"Motion-Appearance Interactive Encoding for Object Segmentation in Unconstrained Videos","date":"2017-07-25","arxiv_id":"1707.07857","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-filter-tracking","title":"Spectral Filter Tracking","date":"2017-07-18","arxiv_id":"1707.05553","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-constraint-preserving-graph-matching","title":"Binary Constraint Preserving Graph Matching","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-semantic-feature-matching","title":"Deep Semantic Feature Matching","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-network-flow-for-multi-object-tracking","title":"Deep Network Flow for Multi-Object Tracking","date":"2017-06-26","arxiv_id":"1706.08482","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertex-nomination-via-seeded-graph-matching","title":"Vertex Nomination Via Seeded Graph Matching","date":"2017-05-01","arxiv_id":"1705.00674","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-multi-layer-graph-factorization","title":"Exploiting Multi-layer Graph Factorization for Multi-attributed Graph Matching","date":"2017-04-24","arxiv_id":"1704.07077","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-modes-by-probabilistic-hypergraphs","title":"Finding Modes by Probabilistic Hypergraphs Shifting","date":"2017-04-12","arxiv_id":"1704.03612","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-heritability-of-functional-brain","title":"Exploring Heritability of Functional Brain Networks with Inexact Graph Matching","date":"2017-03-29","arxiv_id":"1703.10062","repositories_listed":0,"syntology":null},{"url":null,"slug":"product-graph-based-higher-order-contextual","title":"Product Graph-based Higher Order Contextual Similarities for Inexact Subgraph Matching","date":"2017-02-01","arxiv_id":"1702.00391","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-two-layer-modeling-with-latent","title":"Convex Two-Layer Modeling with Latent Structure","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"whos-that-actor-automatic-labelling-of-actors","title":"Who's that Actor? Automatic Labelling of Actors in TV series starting from IMDB Images","date":"2016-11-28","arxiv_id":"1611.09162","repositories_listed":0,"syntology":null},{"url":null,"slug":"proposing-plausible-answers-for-open-ended","title":"Proposing Plausible Answers for Open-ended Visual Question Answering","date":"2016-10-20","arxiv_id":"1610.06620","repositories_listed":0,"syntology":null},{"url":null,"slug":"egocentric-meets-top-view","title":"Egocentric Meets Top-view","date":"2016-08-30","arxiv_id":"1608.08334","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-systematic-approach-for-cross-source-point","title":"A Systematic Approach for Cross-source Point Cloud Registration by Preserving Macro and Micro Structures","date":"2016-08-18","arxiv_id":"1608.05143","repositories_listed":0,"syntology":null},{"url":null,"slug":"quick-and-reliable-document-alignment-via","title":"Quick and Reliable Document Alignment via TF/IDF-weighted Cosine Distance","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/ego2top-matching-viewers-in-egocentric-and","slug":"ego2top-matching-viewers-in-egocentric-and","title":"Ego2Top: Matching Viewers in Egocentric and Top-view Videos","date":"2016-07-24","arxiv_id":"1607.06986","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-consistency-of-the-likelihood","title":"On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching","date":"2016-07-05","arxiv_id":"1607.01369","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-power-iteration-for-multi-graph","title":"Tensor Power Iteration for Multi-Graph Matching","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"information-recovery-in-shuffled-graphs-via","title":"Information Recovery in Shuffled Graphs via Graph Matching","date":"2016-05-08","arxiv_id":"1605.02315","repositories_listed":0,"syntology":null},{"url":null,"slug":"ell_p-box-admm-a-versatile-framework-for","title":"$\\ell_p$-Box ADMM: A Versatile Framework for Integer Programming","date":"2016-04-26","arxiv_id":"1604.07666","repositories_listed":0,"syntology":null},{"url":null,"slug":"recognition-of-facial-expressions-based-on","title":"Recognition of facial expressions based on salient geometric features and support vector machines","date":"2016-04-15","arxiv_id":"1604.04334","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-feature-based-facial-expression","title":"Geometric Feature-Based Facial Expression Recognition in Image Sequences Using Multi-Class AdaBoost and Support Vector Machines","date":"2016-04-12","arxiv_id":"1604.03225","repositories_listed":0,"syntology":null},{"url":null,"slug":"planogram-compliance-checking-based-on","title":"Planogram Compliance Checking Based on Detection of Recurring Patterns","date":"2016-02-22","arxiv_id":"1602.06647","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-achievability-and-converse-bounds","title":"Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching","date":"2016-02-02","arxiv_id":"1602.01042","repositories_listed":0,"syntology":null},{"url":null,"slug":"mapping-tractography-across-subjects","title":"Mapping Tractography Across Subjects","date":"2016-01-29","arxiv_id":"1601.08165","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-matrix-decomposition-perspective-to","title":"A Matrix Decomposition Perspective to Multiple Graph Matching","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-tabu-search-for-graph-matching","title":"Discrete Tabu Search for Graph Matching","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-and-or-graphs-for-graph-matching-and","title":"Mining And-Or Graphs for Graph Matching and Object Discovery","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-region-probabilistic-dice-similarity","title":"Multi-Region Probabilistic Dice Similarity Coefficient using the Aitchison Distance and Bipartite Graph Matching","date":"2015-09-24","arxiv_id":"1509.07244","repositories_listed":0,"syntology":null},{"url":null,"slug":"clique-graph-matching-by-preserving-global","title":"Clique-Graph Matching by Preserving Global & Local Structure","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-hyper-graph-matching","title":"Discrete Hyper-Graph Matching","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph-matching-using-compactness-prior-for","title":"Subgraph Matching Using Compactness Prior for Robust Feature Correspondence","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-minimum-spanning-tree-of-maximum-entropy","title":"The Minimum Spanning Tree of Maximum Entropy","date":"2015-05-23","arxiv_id":"1505.06319","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-edit-distance-a-new-binary-linear","title":"Graph edit distance : a new binary linear programming formulation","date":"2015-05-21","arxiv_id":"1505.05740","repositories_listed":0,"syntology":null},{"url":null,"slug":"activity-recognition-from-videos-with","title":"Activity recognition from videos with parallel hypergraph matching on GPUs","date":"2015-05-04","arxiv_id":"1505.00581","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-tensor-block-coordinate-ascent","title":"A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph Matching","date":"2015-04-29","arxiv_id":"1504.07907","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-multi-graph-matching-approach-via","title":"A General Multi-Graph Matching Approach via Graduated Consistency-regularized Boosting","date":"2015-02-20","arxiv_id":"1502.05840","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-graph-partitioning-and-matching","title":"Integrating Graph Partitioning and Matching for Trajectory Analysis in Video Surveillance","date":"2015-02-02","arxiv_id":"1502.00377","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-weighted-common-subgraph-matching-algorithm","title":"A Weighted Common Subgraph Matching Algorithm","date":"2014-11-04","arxiv_id":"1411.0763","repositories_listed":0,"syntology":null},{"url":null,"slug":"ju-evora-a-graph-based-cross-level-semantic","title":"JU-Evora: A Graph Based Cross-Level Semantic Similarity Analysis using Discourse Information","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prism-person-re-identification-via-structured","title":"PRISM: Person Re-Identification via Structured Matching","date":"2014-06-13","arxiv_id":"1406.4444","repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-graph-mining-and-matching-an","title":"Attributed Graph Mining and Matching: An Attempt to Define and Extract Soft Attributed Patterns","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-matches-in-a-haystack-a-max-pooling","title":"Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-labeling-for-efficient","title":"Probabilistic Labeling for Efficient Referential Grounding based on Collaborative Discourse","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetry-aware-nonrigid-matching-of","title":"Symmetry-Aware Nonrigid Matching of Incomplete 3D Surfaces","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dem-registration-and-error-analysis-using","title":"DEM Registration and Error Analysis using ASCII values","date":"2014-05-30","arxiv_id":"1405.7771","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-polynomial-constraints-in-higher","title":"Geometric Polynomial Constraints in Higher-Order Graph Matching","date":"2014-05-24","arxiv_id":"1405.6261","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-matching-relax-at-your-own-risk","title":"Graph Matching: Relax at Your Own Risk","date":"2014-05-13","arxiv_id":"1405.3133","repositories_listed":0,"syntology":null},{"url":null,"slug":"shiva-an-enhanced-graph-based-ontology","title":"Shiva++: An Enhanced Graph based Ontology Matcher","date":"2014-04-19","arxiv_id":"1404.4983","repositories_listed":0,"syntology":null},{"url":null,"slug":"principled-graph-matching-algorithms-for","title":"Principled Graph Matching Algorithms for Integrating Multiple Data Sources","date":"2014-02-03","arxiv_id":"1402.0282","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-matching-relax-or-not","title":"Graph matching: relax or not?","date":"2014-01-29","arxiv_id":"1401.7623","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeded-graph-matching-via-joint-optimization","title":"Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability","date":"2014-01-16","arxiv_id":"1401.3813","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-semantic-parsing-without-question","title":"Large-scale Semantic Parsing without Question-Answer Pairs","date":"2014-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-multimodal-graph-matching-sparse","title":"Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching","date":"2013-11-25","arxiv_id":"1311.6425","repositories_listed":0,"syntology":null},{"url":null,"slug":"skin-segmentation-based-elastic-bunch-graph","title":"Skin Segmentation based Elastic Bunch Graph Matching for efficient multiple Face Recognition","date":"2013-10-22","arxiv_id":"1310.6066","repositories_listed":0,"syntology":null},{"url":null,"slug":"gncgcp-graduated-nonconvexity-and-graduated","title":"GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure","date":"2013-08-29","arxiv_id":"1308.6388","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-a-probabilistic-earley-parser-for","title":"Exploring a Probabilistic Earley Parser for Event Composition in Biomedical Texts","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-an-approximate-subgraph-matching","title":"Generalizing an Approximate Subgraph Matching-based System to Extract Events in Molecular Biology and Cancer Genetics","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-collaborative-referring-for-situated","title":"Modeling Collaborative Referring for Situated Referential Grounding","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cpn-core-a-text-semantic-similarity-system","title":"CPN-CORE: A Text Semantic Similarity System Infused with Opinion Knowledge","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deformable-graph-matching","title":"Deformable Graph Matching","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stable-and-informative-spectral-signatures","title":"Stable and Informative Spectral Signatures for Graph Matching","date":"2013-04-04","arxiv_id":"1304.1572","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeded-graph-matching","title":"Seeded Graph Matching","date":"2012-09-03","arxiv_id":"1209.0367","repositories_listed":0,"syntology":null},{"url":null,"slug":"janardhan-semantic-textual-similarity-using","title":"janardhan: Semantic Textual Similarity using Universal Networking Language graph matching","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sranjans-semantic-textual-similarity-using","title":"sranjans : Semantic Textual Similarity using Maximal Weighted Bipartite Graph Matching","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-mediating-shared-perceptual-basis-in","title":"Towards Mediating Shared Perceptual Basis in Situated Dialogue","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unt-a-supervised-synergistic-approach-to","title":"UNT: A Supervised Synergistic Approach to Semantic Text Similarity","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-dependency-graph-matching-with-the","title":"Efficient Dependency Graph Matching with the IMS Open Corpus Workbench","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-margin-multi-label-structured","title":"Maximum Margin Multi-Label Structured Prediction","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"face-identification-by-sift-based-complete","title":"Face Identification by SIFT-based Complete Graph Topology","date":"2010-02-02","arxiv_id":"1002.00411","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-integer-projected-fixed-point-method-for","title":"An Integer Projected Fixed Point Method for Graph Matching and MAP Inference","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-family-graph-matching-and-ranking","title":"Exponential Family Graph Matching and Ranking","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"kernels-on-attributed-pointsets-with","title":"Kernels on Attributed Pointsets with Applications","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"ef7780c3c193465113601cf0251de8253ef1c3223e0e7c8016d80a2eca1c3ae5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}