{"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/4","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":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/graph-matching/papers/5","papers":[{"url":null,"slug":"3d-shape-registration-using-spectral-graph","title":"3D Shape Registration Using Spectral Graph Embedding and Probabilistic Matching","date":"2021-06-21","arxiv_id":"2106.11166","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-modal-relational-graph-for-cross-modal","title":"Multi-Modal Relational Graph for Cross-Modal Video Moment Retrieval","date":"2021-06-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"g-2-da-geometry-guided-dual-alignment","title":"G2DA: Geometry-Guided Dual-Alignment Learning for RGB-Infrared Person Re-Identification","date":"2021-06-15","arxiv_id":"2106.07853","repositories_listed":0,"syntology":null},{"url":"/paper/ia-gm-a-deep-bidirectional-learning-method","slug":"ia-gm-a-deep-bidirectional-learning-method","title":"IA-GM: A Deep Bidirectional Learning Method for Graph Matching","date":"2021-05-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-point-cloud-registration-using-graph","title":"Pairwise Point Cloud Registration using Graph Matching and Rotation-invariant Features","date":"2021-05-05","arxiv_id":"2105.02151","repositories_listed":0,"syntology":null},{"url":null,"slug":"versagnn-a-versatile-accelerator-for-graph","title":"VersaGNN: a Versatile accelerator for Graph neural networks","date":"2021-05-04","arxiv_id":"2105.01280","repositories_listed":0,"syntology":null},{"url":null,"slug":"gm-mlic-graph-matching-based-multi-label","title":"GM-MLIC: Graph Matching based Multi-Label Image Classification","date":"2021-04-30","arxiv_id":"2104.14762","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-adaptive-pooling-by-capturing","title":"Hierarchical Adaptive Pooling by Capturing High-order Dependency for Graph Representation Learning","date":"2021-04-13","arxiv_id":"2104.05960","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-2d-and-3d-digital-plant","title":"Integrating 2D and 3D Digital Plant Information Towards Automatic Generation of Digital Twins","date":"2021-04-05","arxiv_id":"2104.01854","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-matching-and-graph-rewriting-grew-tools","title":"Graph Matching and Graph Rewriting: GREW tools for corpus exploration, maintenance and conversion","date":"2021-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/joint-deep-multi-graph-matching-and-3d","slug":"joint-deep-multi-graph-matching-and-3d","title":"Joint Deep Multi-Graph Matching and 3D Geometry Learning from Inhomogeneous 2D Image Collections","date":"2021-03-31","arxiv_id":"2103.17229","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-analogical-mapping-with","title":"Probabilistic Analogical Mapping with Semantic Relation Networks","date":"2021-03-30","arxiv_id":"2103.16704","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-graph-matching-techniques-to-enhance","title":"Applying graph matching techniques to enhance reuse of plant design information","date":"2021-03-23","arxiv_id":"2103.12466","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-d-hops-in-matching-power-law","title":"The Power of $D$-hops in Matching Power-Law Graphs","date":"2021-02-23","arxiv_id":"2102.12975","repositories_listed":0,"syntology":null},{"url":null,"slug":"multitalk-a-highly-branching-dialog-testbed","title":"MultiTalk: A Highly-Branching Dialog Testbed for Diverse Conversations","date":"2021-02-02","arxiv_id":"2102.01263","repositories_listed":0,"syntology":null},{"url":null,"slug":"settling-the-sharp-reconstruction-thresholds","title":"Settling the Sharp Reconstruction Thresholds of Random Graph Matching","date":"2021-01-29","arxiv_id":"2102.00082","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-graph-matching-with-improved-noise","title":"Random Graph Matching with Improved Noise Robustness","date":"2021-01-28","arxiv_id":"2101.11783","repositories_listed":0,"syntology":null},{"url":null,"slug":"amalgam-a-matching-approach-to-fairfy-tabular","title":"AMALGAM: A Matching Approach to fairfy tabuLar data with knowledGe grAph Model","date":"2021-01-17","arxiv_id":"2101.06637","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-baseline-for-weakly-supervised-scene","title":"A Simple Baseline for Weakly-Supervised Scene Graph Generation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-modeling-a-dual-phase","title":"Asynchronous Modeling: A Dual-phase Perspective for Long-Tailed Recognition","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-latent-topology-for-graph-matching","title":"Learning Latent Topology for Graph Matching","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-search-for-fast-maximum-common","title":"Learning to Search for Fast Maximum Common Subgraph Detection","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-graph-matching-networks-for-deep","title":"Multi-level Graph Matching Networks for Deep and Robust Graph Similarity Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/occluded-person-re-identification-with-single","slug":"occluded-person-re-identification-with-single","title":"Occluded Person Re-Identification With Single-Scale Global Representations","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"some-algorithms-on-exact-approximate-and","title":"Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching","date":"2020-12-30","arxiv_id":"2012.15279","repositories_listed":0,"syntology":null},{"url":null,"slug":"articulated-shape-matching-using-laplacian","title":"Articulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration","date":"2020-12-14","arxiv_id":"2012.07340","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-gromov-wasserstein-learning-for","title":"Partial Gromov-Wasserstein Learning for Partial Graph Matching","date":"2020-12-02","arxiv_id":"2012.01252","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attacks-on-deep-graph-matching","title":"Adversarial Attacks on Deep Graph Matching","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-computational-bottlenecks-in","title":"Dominant Z-Eigenpairs of Tensor Kronecker Products are Decoupled and Applications to Higher-Order Graph Matching","date":"2020-11-17","arxiv_id":"2011.08837","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-graph-matching-and-searching-for","title":"Deep Graph Matching and Searching for Semantic Code Retrieval","date":"2020-10-24","arxiv_id":"2010.12908","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-order-relation-construction-and-mining","title":"High-Order Relation Construction and Mining for Graph Matching","date":"2020-10-09","arxiv_id":"2010.04348","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-approach-for-identifying","title":"A general approach for identifying hierarchical symmetry constraints for analog circuit layout","date":"2020-09-30","arxiv_id":"2010.00051","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-edit-distance-reward-learning-to-edit","title":"Graph Edit Distance Reward: Learning to Edit Scene Graph","date":"2020-08-15","arxiv_id":"2008.06651","repositories_listed":0,"syntology":null},{"url":null,"slug":"epipolar-guided-deep-object-matching-for","title":"Epipolar-Guided Deep Object Matching for Scene Change Detection","date":"2020-07-30","arxiv_id":"2007.15540","repositories_listed":0,"syntology":null},{"url":"/paper/gmnet-graph-matching-network-for-large-scale","slug":"gmnet-graph-matching-network-for-large-scale","title":"GMNet: Graph Matching Network for Large Scale Part Semantic Segmentation in the Wild","date":"2020-07-17","arxiv_id":"2007.09073","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-graph-matching-networks-for-chinese","title":"Neural Graph Matching Networks for Chinese Short Text Matching","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"determinant-regularization-for-gradient","title":"Determinant Regularization for Gradient-Efficient Graph Matching","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-combinatorial-solver-for-graph","title":"Learning Combinatorial Solver for Graph Matching","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-semantic-matching-by-exploring-high","title":"Visual-Semantic Matching by Exploring High-Order Attention and Distraction","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-proprioceptive-localization-using","title":"Graph-based Proprioceptive Localization Using a Discrete Heading-Length Feature Sequence Matching Approach","date":"2020-05-27","arxiv_id":"2005.13704","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partitioning-and-graph-neural-network","title":"Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation","date":"2020-05-16","arxiv_id":"2005.08008","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-deconvolutional-generation","title":"Graph Deconvolutional Generation","date":"2020-02-14","arxiv_id":"2002.07087","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-detection-of-maximum-common-subgraph-via","title":"GLSearch: Maximum Common Subgraph Detection via Learning to Search","date":"2020-02-08","arxiv_id":"2002.03129","repositories_listed":0,"syntology":null},{"url":null,"slug":"fabricated-pictures-detection-with-graph","title":"Fabricated Pictures Detection with Graph Matching","date":"2020-01-16","arxiv_id":"2002.03720","repositories_listed":0,"syntology":null},{"url":"/paper/learning-deep-graph-matching-with-channel","slug":"learning-deep-graph-matching-with-channel","title":"Learning deep graph matching with channel-independent embedding and Hungarian attention","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-graph-matching-and-regularized-2","title":"Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-arbitrary-throughput-fairness-trade","title":"Achieving Arbitrary Throughput-Fairness Trade-offs in the Inter Cell Interference Coordination with Fixed Transmit Power Problem","date":"2019-12-27","arxiv_id":"1912.12001","repositories_listed":0,"syntology":null},{"url":null,"slug":"elastic-registration-based-on-compliance","title":"Elastic registration based on compliance analysis and biomechanical graph matching","date":"2019-12-13","arxiv_id":"1912.06353","repositories_listed":0,"syntology":null},{"url":"/paper/glmnet-graph-learning-matching-networks-for","slug":"glmnet-graph-learning-matching-networks-for","title":"GLMNet: Graph Learning-Matching Networks for Feature Matching","date":"2019-11-18","arxiv_id":"1911.07681","repositories_listed":0,"syntology":null},{"url":null,"slug":"scene-graph-based-image-retrieval-a-case","title":"Scene Graph based Image Retrieval -- A case study on the CLEVR Dataset","date":"2019-11-03","arxiv_id":"1911.00850","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-losses-through-generalized","title":"Differentiable Combinatorial Losses through Generalized Gradients of Linear Programs","date":"2019-10-18","arxiv_id":"1910.08211","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-graph-matching-networks","title":"Heterogeneous Graph Matching Networks","date":"2019-10-17","arxiv_id":"1910.08074","repositories_listed":0,"syntology":null},{"url":null,"slug":"deformable-surface-tracking-by-graph-matching","title":"Deformable Surface Tracking by Graph Matching","date":"2019-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-graph-matching-networks-for-deep","title":"Hierarchical Graph Matching Networks for Deep Graph Similarity Learning","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-cross-view-matching-for","title":"Exploiting Global Camera Network Constraints for Unsupervised Video Person Re-identification","date":"2019-08-27","arxiv_id":"1908.10486","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-graph-matching-and-regularized","title":"Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality","date":"2019-07-20","arxiv_id":"1907.08883","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-graph-matching-and-regularized-1","title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","date":"2019-07-20","arxiv_id":"1907.08880","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-congenital-heart-disease","title":"Accurate Congenital Heart Disease Model Generation for 3D Printing","date":"2019-07-06","arxiv_id":"1907.05273","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convex-relaxation-for-multi-graph-matching","title":"A Convex Relaxation for Multi-Graph Matching","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"radar-only-ego-motion-estimation-in-difficult","title":"Radar-only ego-motion estimation in difficult settings via graph matching","date":"2019-04-25","arxiv_id":"1904.11476","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoding-molecular-graph-embeddings-with","title":"Decoding Molecular Graph Embeddings with Reinforcement Learning","date":"2019-04-18","arxiv_id":"1904.08915","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-permutation-synchronization","title":"Probabilistic Permutation Synchronization using the Riemannian Structure of the Birkhoff Polytope","date":"2019-04-11","arxiv_id":"1904.05814","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-upper-bound-for-minimum-true-matches-in","title":"An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing","date":"2019-03-29","arxiv_id":"1903.12527","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-query-answering-by-entity-attribute","title":"Visual Query Answering by Entity-Attribute Graph Matching and Reasoning","date":"2019-03-16","arxiv_id":"1903.06994","repositories_listed":0,"syntology":null},{"url":null,"slug":"drug-drug-interaction-prediction-based-on-co","title":"Drug-drug interaction prediction based on co-medication patterns and graph matching","date":"2019-02-22","arxiv_id":"1902.08675","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-theory-for-structured-prediction","title":"A General Theory for Structured Prediction with Smooth Convex Surrogates","date":"2019-02-05","arxiv_id":"1902.01958","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-optimal-assignments-in-linear-time","title":"Computing Optimal Assignments in Linear Time for Approximate Graph Matching","date":"2019-01-29","arxiv_id":"1901.10356","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoshufflenet-learning-permutation-matrices","title":"AutoShuffleNet: Learning Permutation Matrices via an Exact Lipschitz Continuous Penalty in Deep Convolutional Neural Networks","date":"2019-01-24","arxiv_id":"1901.08624","repositories_listed":0,"syntology":null},{"url":null,"slug":"gm-pll-graph-matching-based-partial-label","title":"GM-PLL: Graph Matching based Partial Label Learning","date":"2019-01-10","arxiv_id":"1901.03073","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-likelihood-estimation-and-graph","title":"Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks","date":"2018-12-26","arxiv_id":"1812.10519","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-graph-matching-beyond-quadratic","title":"Generalizing Graph Matching beyond Quadratic Assignment Model","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sample-complexity-of-semi-supervised","title":"The Sample Complexity of Semi-Supervised Learning with Nonparametric Mixture Models","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-disparate-image-pairs-using-shape","title":"Matching Disparate Image Pairs Using Shape-Aware ConvNets","date":"2018-11-24","arxiv_id":"1811.09889","repositories_listed":0,"syntology":null},{"url":null,"slug":"elastic-registration-of-geodesic-vascular","title":"Elastic Registration of Geodesic Vascular Graphs","date":"2018-09-14","arxiv_id":"1809.05499","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-of-nonparametric-semi","title":"Sample Complexity of Nonparametric Semi-Supervised Learning","date":"2018-09-10","arxiv_id":"1809.03073","repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-multi-graph-matching-via","title":"Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/neural-graph-matching-networks-for-fewshot-3d","slug":"neural-graph-matching-networks-for-fewshot-3d","title":"Neural Graph Matching Networks for Fewshot 3D Action Recognition","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-with-features-algorithm-and-a-graph","title":"Ranking with Features: Algorithm and A Graph Theoretic Analysis","date":"2018-08-11","arxiv_id":"1808.03857","repositories_listed":0,"syntology":null},{"url":null,"slug":"category-level-6d-object-pose-recovery-in","title":"Category-level 6D Object Pose Recovery in Depth Images","date":"2018-08-01","arxiv_id":"1808.00255","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-polynomial-time-unseeded-graph","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons","date":"2018-07-29","arxiv_id":"1807.11027","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptively-transforming-graph-matching","title":"Adaptively Transforming Graph Matching","date":"2018-07-26","arxiv_id":"1807.10160","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeded-graph-matching-via-large-neighborhood","title":"Seeded Graph Matching via Large Neighborhood Statistics","date":"2018-07-26","arxiv_id":"1807.10262","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-task-allocation-in-multi-robot","title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering","date":"2018-07-20","arxiv_id":"1807.07957","repositories_listed":0,"syntology":null},{"url":null,"slug":"poster-abstract-hierarchical-subchannel","title":"Poster Abstract: Hierarchical Subchannel Allocation for Mode-3 Vehicle-to-Vehicle Sidelink Communications","date":"2018-07-12","arxiv_id":"1807.05929","repositories_listed":0,"syntology":null},{"url":null,"slug":"unseeded-low-rank-graph-matching-by-transform","title":"Unseeded low-rank graph matching by transform-based unsupervised point registration","date":"2018-07-12","arxiv_id":"1807.04680","repositories_listed":0,"syntology":null},{"url":null,"slug":"trquery-an-embedding-based-framework-for","title":"TrQuery: An Embedding-based Framework for Recommanding SPARQL Queries","date":"2018-06-16","arxiv_id":"1806.06205","repositories_listed":0,"syntology":null},{"url":"/paper/deep-learning-of-graph-matching","slug":"deep-learning-of-graph-matching","title":"Deep Learning of Graph Matching","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-domain-adaptation-using-2","title":"Unsupervised Domain Adaptation using Regularized Hyper-graph Matching","date":"2018-05-22","arxiv_id":"1805.08874","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-and-successive-resource-allocation","title":"Parallel and Successive Resource Allocation for V2V Communications in Overlapping Clusters","date":"2018-05-18","arxiv_id":"1805.07012","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-resource-allocation-with-conflict","title":"Graph-Based Resource Allocation with Conflict Avoidance for V2V Broadcast Communications","date":"2018-05-16","arxiv_id":"1805.06550","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-and-efficient-graph-correspondence","title":"Robust and Efficient Graph Correspondence Transfer for Person Re-identification","date":"2018-05-15","arxiv_id":"1805.06323","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearly-efficient-algorithms-for-the-graph","title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","date":"2018-05-07","arxiv_id":"1805.02349","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-performance-of-a-canonical-labeling","title":"Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs","date":"2018-04-25","arxiv_id":"1804.09758","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-matching-with-anchor-nodes-a-learning","title":"Graph Matching with Anchor Nodes: A Learning Approach","date":"2018-04-10","arxiv_id":"1804.03715","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-correspondence-transfer-for-person-re","title":"Graph Correspondence Transfer for Person Re-identification","date":"2018-04-01","arxiv_id":"1804.00242","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutions-on-spectral-embeddings","title":"Graph Convolutions on Spectral Embeddings: Learning of Cortical Surface Data","date":"2018-03-27","arxiv_id":"1803.10336","repositories_listed":0,"syntology":null},{"url":null,"slug":"matched-filters-for-noisy-induced-subgraph","title":"Matched Filters for Noisy Induced Subgraph Detection","date":"2018-03-06","arxiv_id":"1803.02423","repositories_listed":0,"syntology":null},{"url":null,"slug":"bipartite-graph-matching-for-keyframe-summary","title":"Bipartite Graph Matching for Keyframe Summary Evaluation","date":"2017-12-19","arxiv_id":"1712.06914","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-multiple-graph-matching-with-multi","title":"Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization","date":"2017-12-07","arxiv_id":"1712.02575","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-matching-via-multiplicative-update","title":"Graph Matching via Multiplicative Update Algorithm","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"8208b7c06e90fff4b916a01169961d9a588c7b46e41f24fac60c44e92dec7ff8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}