Browse State-of-the-Art › Hypergraph Matching

Hypergraph Matching

5 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Graphs

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 13 · with a code link: 5 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 13 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 13 of 13, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 20 Apr 2021 4 repositories listed
    Finding an optimal correspondence between point sets is a common task in computer vision.
  • 22 Apr 2017 2 repositories listed
    Ranking algorithms are deployed widely to order a set of items in applications such as search engines, news feeds, and recommendation systems.
  • 1 Jan 2021 1 repository listed
    Specifically, given two hypergraphs to be matched, we first construct an association hypergraph over them and convert the hypergraph matching problem into a node classification problem on the association hypergraph.
  • 5 Jul 2020 1 repository listed
    Recent increase in the availability of warped images projected onto a manifold (e. g., omnidirectional spherical images), coupled with the success of higher-order assignment methods, has sparked an interest in the…
  • 26 Nov 2019 1 repository listed
    We also show how to extend our network to hypergraph matching, and matching of multiple graphs.
  • DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching
    19 Dec 2024 0 repositories listed
    Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging.
  • Fair Computation Offloading for RSMA-Assisted Mobile Edge Computing Networks
    16 Jun 2024 0 repositories listed
    Rate splitting multiple access (RSMA) provides a flexible transmission framework that can be applied in mobile edge computing (MEC) systems.
  • Hypergraph-Aided Task-Resource Matching for Maximizing Value of Task Completion in Collaborative IoT Systems
    30 May 2024 0 repositories listed
    With the growing scale and intrinsic heterogeneity of Internet of Things (IoT) systems, distributed device collaboration becomes essential for effective task completion by dynamically utilizing limited communication and…
  • CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition
    26 Feb 2024 0 repositories listed
    To achieve greater accuracy, hypergraph matching algorithms require exponential increases in computational resources.
  • Kinematic Structure Correspondences via Hypergraph Matching
    1 Jun 2016 0 repositories listed
    In this paper, we present a novel framework for finding the kinematic structure correspondence between two objects in videos via hypergraph matching.
  • An Efficient Multilinear Optimization Framework for Hypergraph Matching
    9 Nov 2015 0 repositories listed
    Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information.
  • Activity recognition from videos with parallel hypergraph matching on GPUs
    4 May 2015 0 repositories listed
    In this paper, we propose a method for activity recognition from videos based on sparse local features and hypergraph matching.
  • A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph Matching
    29 Apr 2015 0 repositories listed
    The estimation of correspondences between two images resp. point sets is a core problem in computer vision.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections