{"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/3","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":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/graph-matching/papers/4","papers":[{"url":null,"slug":"semi-supervised-image-captioning-considering","title":"Semi-Supervised Image Captioning Considering Wasserstein Graph Matching","date":"2024-03-26","arxiv_id":"2403.17995","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphbev-towards-robust-bev-feature-alignment","title":"GraphBEV: Towards Robust BEV Feature Alignment for Multi-Modal 3D Object Detection","date":"2024-03-18","arxiv_id":"2403.11848","repositories_listed":0,"syntology":null},{"url":null,"slug":"bigraph-matching-weighted-with-learnt","title":"Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation","date":"2024-03-11","arxiv_id":"2403.07131","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-quadratic-assignment-network-for","title":"Ensemble Quadratic Assignment Network for Graph Matching","date":"2024-03-11","arxiv_id":"2403.06457","repositories_listed":0,"syntology":null},{"url":null,"slug":"extreme-point-pursuit-part-ii-further-error","title":"Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications","date":"2024-03-11","arxiv_id":"2403.06513","repositories_listed":0,"syntology":null},{"url":null,"slug":"cursor-scalable-mixed-order-hypergraph","title":"CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition","date":"2024-02-26","arxiv_id":"2402.16594","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-graph-graph-matching-for-coronary","title":"Multi-graph Graph Matching for Coronary Artery Semantic Labeling","date":"2024-02-24","arxiv_id":"2402.15894","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-geometric-graph-alignment-with-graph","title":"Perfect Recovery for Random Geometric Graph Matching with Shallow Graph Neural Networks","date":"2024-02-12","arxiv_id":"2402.07340","repositories_listed":0,"syntology":null},{"url":null,"slug":"relational-matching-for-weakly-semi","title":"Relational Matching for Weakly Semi-Supervised Oriented Object Detection","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-3d-structure-inference-from","title":"Unsupervised 3D Structure Inference from Category-Specific Image Collections","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sat-based-algorithms-for-regular-graph","title":"SAT-Based Algorithms for Regular Graph Pattern Matching","date":"2023-12-15","arxiv_id":"2312.09995","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-shot-point-cloud-registration","title":"ZeroReg: Zero-Shot Point Cloud Registration with Foundation Models","date":"2023-12-05","arxiv_id":"2312.03032","repositories_listed":0,"syntology":null},{"url":"/paper/exploring-naive-bayes-classifiers-for-tabular","slug":"exploring-naive-bayes-classifiers-for-tabular","title":"Exploring Naive Bayes Classifiers for Tabular Data to Knowledge Graph Matching","date":"2023-11-20","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/torchictab-semantic-table-annotation-with","slug":"torchictab-semantic-table-annotation-with","title":"TorchicTab: Semantic Table Annotation with Wikidata and Language Models","date":"2023-11-20","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"olala-ontology-matching-with-large-language","title":"OLaLa: Ontology Matching with Large Language Models","date":"2023-11-07","arxiv_id":"2311.03837","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-pre-trained-model","title":"Differentially Private Pre-Trained Model Fusion using Decentralized Federated Graph Matching","date":"2023-11-05","arxiv_id":"2311.03396","repositories_listed":0,"syntology":null},{"url":null,"slug":"m3c-a-framework-towards-convergent-flexible","title":"M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering","date":"2023-10-27","arxiv_id":"2310.18444","repositories_listed":0,"syntology":null},{"url":null,"slug":"dhot-gm-robust-graph-matching-using-a","title":"Robust Graph Matching Using An Unbalanced Hierarchical Optimal Transport Framework","date":"2023-10-18","arxiv_id":"2310.12081","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphalign-enhancing-accurate-feature-1","title":"GraphAlign: Enhancing Accurate Feature Alignment by Graph matching for Multi-Modal 3D Object Detection","date":"2023-10-12","arxiv_id":"2310.08261","repositories_listed":0,"syntology":null},{"url":null,"slug":"agmdt-virtual-staining-of-renal-histology","title":"AGMDT: Virtual Staining of Renal Histology Images with Adjacency-Guided Multi-Domain Transfer","date":"2023-09-12","arxiv_id":"2309.06421","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-vision-and-language-through-graphs","title":"Explaining Vision and Language through Graphs of Events in Space and Time","date":"2023-08-29","arxiv_id":"2309.08612","repositories_listed":0,"syntology":null},{"url":null,"slug":"gotta-match-em-all-solution-diversification","title":"Gotta match 'em all: Solution diversification in graph matching matched filters","date":"2023-08-25","arxiv_id":"2308.13451","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-based-on-open-research-knowledge","title":"An approach based on Open Research Knowledge Graph for Knowledge Acquisition from scientific papers","date":"2023-08-23","arxiv_id":"2308.12981","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyper-association-graph-matching-with","title":"Hyper Association Graph Matching with Uncertainty Quantification for Coronary Artery Semantic Labeling","date":"2023-08-20","arxiv_id":"2308.10320","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-icd-based-semantic-similarity-by","title":"Improving ICD-based semantic similarity by accounting for varying degrees of comorbidity","date":"2023-08-14","arxiv_id":"2308.07359","repositories_listed":0,"syntology":null},{"url":null,"slug":"shape-graph-matching-network-sgm-net","title":"Shape-Graph Matching Network (SGM-net): Registration for Statistical Shape Analysis","date":"2023-08-14","arxiv_id":"2308.06869","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-semantic-graph-matching-for-large-scale","title":"Deep Semantic Graph Matching for Large-scale Outdoor Point Clouds Registration","date":"2023-08-10","arxiv_id":"2308.05314","repositories_listed":0,"syntology":null},{"url":null,"slug":"blind-graph-matching-using-graph-signals","title":"Blind Graph Matching Using Graph Signals","date":"2023-06-27","arxiv_id":"2306.15747","repositories_listed":0,"syntology":null},{"url":null,"slug":"lic-gan-language-information-conditioned","title":"LIC-GAN: Language Information Conditioned Graph Generative GAN Model","date":"2023-06-02","arxiv_id":"2306.01937","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-iterative-algorithm-for-1","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","date":"2023-06-01","arxiv_id":"2306.00266","repositories_listed":0,"syntology":null},{"url":null,"slug":"abode-ab-initio-antibody-design-using","title":"AbODE: Ab Initio Antibody Design using Conjoined ODEs","date":"2023-05-31","arxiv_id":"2306.01005","repositories_listed":0,"syntology":null},{"url":null,"slug":"gest-the-graph-of-events-in-space-and-time-as","title":"GEST: the Graph of Events in Space and Time as a Common Representation between Vision and Language","date":"2023-05-22","arxiv_id":"2305.12940","repositories_listed":0,"syntology":null},{"url":null,"slug":"coronary-artery-semantic-labeling-using-edge","title":"Coronary Artery Semantic Labeling using Edge Attention Graph Matching Network","date":"2023-05-21","arxiv_id":"2305.12327","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-vlgm-bi-level-class-severity-aware-vision","title":"Bi-VLGM : Bi-Level Class-Severity-Aware Vision-Language Graph Matching for Text Guided Medical Image Segmentation","date":"2023-05-20","arxiv_id":"2305.12231","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-segmentation-via-probabilistic-graph","title":"Image Segmentation via Probabilistic Graph Matching","date":"2023-05-13","arxiv_id":"2305.07954","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-learning-of-object","title":"Self-Supervised Learning of Object Segmentation from Unlabeled RGB-D Videos","date":"2023-04-09","arxiv_id":"2304.04325","repositories_listed":0,"syntology":null},{"url":null,"slug":"deformable-kernel-expansion-model-for","title":"Deformable Kernel Expansion Model for Efficient Arbitrary-shaped Scene Text Detection","date":"2023-03-28","arxiv_id":"2303.15737","repositories_listed":0,"syntology":null},{"url":null,"slug":"pats-patch-area-transportation-with","title":"PATS: Patch Area Transportation with Subdivision for Local Feature Matching","date":"2023-03-14","arxiv_id":"2303.07700","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-global-robot-localization","title":"Graph-based Global Robot Localization Informing Situational Graphs with Architectural Graphs","date":"2023-03-03","arxiv_id":"2303.02076","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-pose-track-with-graph-guided-sparse","title":"Texture-Based Input Feature Selection for Action Recognition","date":"2023-02-28","arxiv_id":"2303.00138","repositories_listed":0,"syntology":null},{"url":null,"slug":"point-cloud-registration-based-on-graph","title":"Graph Matching Optimization Network for Point Cloud Registration","date":"2023-02-12","arxiv_id":"2302.05844","repositories_listed":0,"syntology":null},{"url":null,"slug":"agmn-association-graph-based-graph-matching","title":"AGMN: Association Graph-based Graph Matching Network for Coronary Artery Semantic Labeling on Invasive Coronary Angiograms","date":"2023-01-11","arxiv_id":"2301.04733","repositories_listed":0,"syntology":null},{"url":null,"slug":"pa-gm-position-aware-learning-of-embedding","title":"PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching","date":"2023-01-05","arxiv_id":"2301.01932","repositories_listed":0,"syntology":null},{"url":null,"slug":"cigar-cross-modality-graph-reasoning-for","title":"CIGAR: Cross-Modality Graph Reasoning for Domain Adaptive Object Detection","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"editable-image-geometric-abstraction-via","title":"Editable Image Geometric Abstraction via Neural Primitive Assembly","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"video-action-segmentation-via-contextually","title":"Video Action Segmentation via Contextually Refined Temporal Keypoints","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-iterative-algorithm-for","title":"A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation","date":"2022-12-28","arxiv_id":"2212.13677","repositories_listed":0,"syntology":null},{"url":"/paper/universe-points-representation-learning-for","slug":"universe-points-representation-learning-for","title":"Universe Points Representation Learning for Partial Multi-Graph Matching","date":"2022-12-01","arxiv_id":"2212.00780","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-key-points-detection-and-matching-for","title":"Fast Key Points Detection and Matching for Tree-Structured Images","date":"2022-11-07","arxiv_id":"2211.03242","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilingual-lexicon-induction-for-low-resource-1","title":"Bilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport","date":"2022-10-25","arxiv_id":"2210.14378","repositories_listed":0,"syntology":null},{"url":"/paper/kgcode-tab-results-for-semtab-2022","slug":"kgcode-tab-results-for-semtab-2022","title":"KGCODE-Tab Results for SemTab 2022","date":"2022-10-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/results-of-semtab-2022","slug":"results-of-semtab-2022","title":"Results of SemTab 2022","date":"2022-10-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-context-aided-unicity-matching-for","title":"End-to-End Context-Aided Unicity Matching for Person Re-identification","date":"2022-10-20","arxiv_id":"2210.12008","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-universe-model-for-partial-matching","title":"Learning Universe Model for Partial Matching Networks over Multiple Graphs","date":"2022-10-19","arxiv_id":"2210.10374","repositories_listed":0,"syntology":null},{"url":null,"slug":"quant-quantum-annealing-with-learnt-couplings","title":"QuAnt: Quantum Annealing with Learnt Couplings","date":"2022-10-13","arxiv_id":"2210.08114","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernelized-multi-graph-matching","title":"Kernelized multi-graph matching","date":"2022-10-11","arxiv_id":"2210.05206","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-sentence-matching-via-interacting","title":"Semantic Sentence Matching via Interacting Syntax Graphs","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"random-graph-matching-at-otter-s-threshold","title":"Random graph matching at Otter's threshold via counting chandeliers","date":"2022-09-25","arxiv_id":"2209.12313","repositories_listed":0,"syntology":null},{"url":null,"slug":"closing-the-loop-graph-networks-to-unify","title":"Closing the Loop: Graph Networks to Unify Semantic Objects and Visual Features for Multi-object Scenes","date":"2022-09-24","arxiv_id":"2209.11894","repositories_listed":0,"syntology":null},{"url":null,"slug":"gollum-a-gold-standard-for-large-scale-multi","title":"Gollum: A Gold Standard for Large Scale Multi Source Knowledge Graph Matching","date":"2022-09-15","arxiv_id":"2209.07479","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphing-the-future-activity-and-next-active","title":"Graphing the Future: Activity and Next Active Object Prediction using Graph-based Activity Representations","date":"2022-09-12","arxiv_id":"2209.05194","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-domain-adaptation-for-point","title":"Unsupervised Domain Adaptation for Point Cloud Semantic Segmentation via Graph Matching","date":"2022-08-09","arxiv_id":"2208.04510","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-recommender-system-for-equitable-public-art","title":"An Equity-Aware Recommender System for Curating Art Exhibits Based on Locally-Constrained Graph Matching","date":"2022-07-28","arxiv_id":"2207.14367","repositories_listed":0,"syntology":null},{"url":null,"slug":"boxgraph-semantic-place-recognition-and-pose","title":"BoxGraph: Semantic Place Recognition and Pose Estimation from 3D LiDAR","date":"2022-06-30","arxiv_id":"2206.15154","repositories_listed":0,"syntology":null},{"url":null,"slug":"motion-estimation-for-large-displacements-and","title":"Motion Estimation for Large Displacements and Deformations","date":"2022-06-24","arxiv_id":"2206.12464","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-keypoint-matching-using-graph-neural","title":"Image Keypoint Matching using Graph Neural Networks","date":"2022-05-27","arxiv_id":"2205.14275","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustered-graph-matching-for-label-recovery","title":"Clustered Graph Matching for Label Recovery and Graph Classification","date":"2022-05-06","arxiv_id":"2205.03486","repositories_listed":0,"syntology":null},{"url":null,"slug":"kermit-a-transformer-based-approach-for","title":"KERMIT - A Transformer-Based Approach for Knowledge Graph Matching","date":"2022-04-29","arxiv_id":"2204.13931","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-graph-matching-for-modification","title":"Neural Graph Matching for Modification Similarity Applied to Electronic Document Comparison","date":"2022-04-12","arxiv_id":"2204.05486","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeded-graph-matching-for-the-correlated","title":"Seeded graph matching for the correlated Gaussian Wigner model via the projected power method","date":"2022-04-08","arxiv_id":"2204.04099","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-robot-active-mapping-via-neural","title":"Multi-Robot Active Mapping via Neural Bipartite Graph Matching","date":"2022-03-30","arxiv_id":"2203.16319","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-community-recovery-in-correlated","title":"Exact Community Recovery in Correlated Stochastic Block Models","date":"2022-03-29","arxiv_id":"2203.15736","repositories_listed":0,"syntology":null},{"url":"/paper/q-fw-a-hybrid-classical-quantum-frank-wolfe","slug":"q-fw-a-hybrid-classical-quantum-frank-wolfe","title":"Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization","date":"2022-03-23","arxiv_id":"2203.12633","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/q-fw-a-hybrid-classical-quantum-frank-wolfe#ran","syntology_url":"https://syntology.ai/paper/2203.12633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12633"}},"official":null}},{"url":null,"slug":"optimal-transport-based-graph-matching-for-3d","title":"Optimal Transport-based Graph Matching for 3D retinal OCT image registration","date":"2022-02-28","arxiv_id":"2203.00069","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-graph-matching-in-geometric-models-the","title":"Random Graph Matching in Geometric Models: the Case of Complete Graphs","date":"2022-02-22","arxiv_id":"2202.10662","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-matching-approach-for-cross-view","title":"A Graph-Matching Approach for Cross-view Registration of Over-view 2 and Street-view based Point Clouds","date":"2022-02-14","arxiv_id":"2202.06857","repositories_listed":0,"syntology":null},{"url":null,"slug":"sigma-a-structural-inconsistency-reducing","title":"SIGMA: A Structural Inconsistency Reducing Graph Matching Algorithm","date":"2022-02-06","arxiv_id":"2202.02797","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilingual-lexicon-induction-for-low-resource","title":"Bilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-object-level-topological-semantic","title":"Lightweight Object-level Topological Semantic Mapping and Long-term Global Localization based on Graph Matching","date":"2022-01-16","arxiv_id":"2201.05977","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-probabilistic-graph-matching","title":"Deep Probabilistic Graph Matching","date":"2022-01-05","arxiv_id":"2201.01603","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-matching-perspective-with","title":"A Graph Matching Perspective With Transformers on Video Instance Segmentation","date":"2022-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-functional-map-synchronization-for","title":"Riemannian Functional Map Synchronization for Probabilistic Partial Correspondence in Shape Networks","date":"2021-11-29","arxiv_id":"2111.14762","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-named-entity-recognition-via","title":"Cross-domain Named Entity Recognition via Graph Matching","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spa-gcn-efficient-and-flexible-gcn","title":"SPA-GCN: Efficient and Flexible GCN Accelerator with an Application for Graph Similarity Computation","date":"2021-11-10","arxiv_id":"2111.05936","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-to-inference-driven-dialogue","title":"An Approach to Inference-Driven Dialogue Management within a Social Chatbot","date":"2021-10-31","arxiv_id":"2111.00570","repositories_listed":0,"syntology":null},{"url":null,"slug":"results-of-semtab-2021","title":"Results of SemTab 2021","date":"2021-10-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-joint-graph-matching-and-clustering","title":"Convex Joint Graph Matching and Clustering via Semidefinite Relaxations","date":"2021-10-21","arxiv_id":"2110.11335","repositories_listed":0,"syntology":null},{"url":"/paper/gamnet-robust-feature-matching-via-graph","slug":"gamnet-robust-feature-matching-via-graph","title":"GAMnet: Robust Feature Matching via Graph Adversarial-Matching Network","date":"2021-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proxy-graph-matching-with-proximal-matching","title":"Proxy Graph Matching with Proximal Matching Networks","date":"2021-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tag-toward-accurate-social-media-content","title":"TAG: Toward Accurate Social Media Content Tagging with a Concept Graph","date":"2021-10-13","arxiv_id":"2110.06892","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-matching-of-random-graphs-with-constant","title":"Exact Matching of Random Graphs with Constant Correlation","date":"2021-10-11","arxiv_id":"2110.05000","repositories_listed":0,"syntology":null},{"url":null,"slug":"sgmnet-scene-graph-matching-network-for-few","title":"SGMNet: Scene Graph Matching Network for Few-Shot Remote Sensing Scene Classification","date":"2021-10-09","arxiv_id":"2110.04494","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-matching-models-for-graph","title":"Matching Models for Graph Retrieval","date":"2021-10-03","arxiv_id":"2110.00925","repositories_listed":0,"syntology":null},{"url":"/paper/kepler-asi-at-semtab-2021","slug":"kepler-asi-at-semtab-2021","title":"Kepler-aSI at SemTab 2021","date":"2021-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-quadratic-optimisation-over-the","title":"Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation","date":"2021-09-30","arxiv_id":"2110.00053","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-key-information-extraction-from","title":"One-shot Key Information Extraction from Document with Deep Partial Graph Matching","date":"2021-09-26","arxiv_id":"2109.13967","repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-with-transformers-in-melt","title":"Matching with Transformers in MELT","date":"2021-09-15","arxiv_id":"2109.07401","repositories_listed":0,"syntology":null},{"url":"/paper/weisfeiler-leman-in-the-bamboo-novel-amr","slug":"weisfeiler-leman-in-the-bamboo-novel-amr","title":"Weisfeiler-Leman in the BAMBOO: Novel AMR Graph Metrics and a Benchmark for AMR Graph Similarity","date":"2021-08-26","arxiv_id":"2108.11949","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlated-stochastic-block-models-exact","title":"Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities","date":"2021-07-14","arxiv_id":"2107.06767","repositories_listed":0,"syntology":null},{"url":null,"slug":"adiabatic-quantum-graph-matching-with","title":"Adiabatic Quantum Graph Matching with Permutation Matrix Constraints","date":"2021-07-08","arxiv_id":"2107.04032","repositories_listed":0,"syntology":null}],"record_sha256":"ef402f12c6e36e320c460308459709767df87bf7a6aa57bf08e0bf1ac13092a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}