20 results for “Hypergraph-based representation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
This paper identifies the fundamental limits of hypergraph edge partitioning and presents a near-optimal algorithm for a broad class of probabilistic hypergraph models.
This paper studies Euclidean embeddings of higher-order line metrics arising from hypergraphs and improves the worst-case Euclidean distortion from Θ(log n) to Θ(√log log n) for α-acyclic hypergraphs.
An approach is described to support rigid α canonical variables in an e-graph.
Prashant Gokhale, Piotr Indyk, Yuhao Liu, Sandeep Silwal +2 more
This paper investigates compact reachability embeddings for hierarchical data and provides theoretical guarantees for representing hierarchies using embeddings with dimensions dependent on graph param…
This paper introduces and studies novel covers of hypergraphs, Abelian and Catalan covers, to capture dependences between hyperedges.
This paper introduces HySpecPro, a single-level hypergraph partitioner that performs end-to-end optimization in a spectral embedding space, delivering cut quality comparable to multilevel methods with…
Ziying Chen, Yang Cao, He Sun, Beining Yang +1 more
The paper proposes a novel geometric embedding hashing method to recover object correspondences (vector links) between two embedding clouds generated by different black-box encoders using only a small…
The authors prove that the $t$-uniform hypergraphicality problem is fixed-parameter tractable parameterized by $(k,t)$, where $k$ is the number of distinct degrees.
Sjoerd Vink, Suyang Li, Brian Montambault, Michael Behrisch +2 more
This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.
This paper proves that single-vector embeddings require a larger representation size than multi-vector embeddings to approximate certain similarities.
This paper characterizes acyclic hypergraphs according to whether they admit unique canonical join trees as root and provides a linear-time algorithm to construct them.
This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.
Yugao Zhu, Zhicheng Guo, Shang Liu, Mengming Li +2 more
The paper proposes a novel memetic framework, IMPart, for k-way hypergraph partitioning that outperforms existing methods for large-k problems.
Yiwei Liao, Shurui Tu, Yong Xiao, Yingyu Li +1 more
This paper proposes a novel hypergraph-based framework for semantic-aware communication that improves semantic inference accuracy.