Results 101 to 110 of about 41,298 (230)
Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs [PDF]
Noga Alon, Adi Shraibman
openalex +1 more source
An incremental algorithm for computing the transversal hypergraph [PDF]
László Szathmáry
openalex +1 more source
PLNet: Persistent Laplacian neural network for protein–protein binding free energy prediction
Abstract Recent advances in topology‐based modeling have greatly improved molecular prediction tasks, particularly in protein–ligand binding affinity. However, when the focus shifts to predicting protein–protein interactions (PPIs) binding free energy, the question becomes significantly more challenging due to the ineffective use of topological ...
Xingjian Xu +3 more
wiley +1 more source
Cross-modal Hypergraph Optimisation Learning for Multimodal Sentiment Analysis [PDF]
Sentiment expressions are multimodal,and more accurate emotions can be derived through multiple modalities such as verbal,audio,and visual.Studying the interactions among modalities can effectively improve the accuracy of multimodal sentiment analysis ...
JIANG Kun, ZHAO Zhengpeng, PU Yuanyuan, HUANG Jian, GU Jinjing, XU Dan
doaj +1 more source
The hybrid approach to Quantum Supervised Machine Learning is compatible with Noisy Intermediate Scale Quantum (NISQ) devices but hardly useful. Pure quantum kernels requiring fault‐tolerant quantum computers are more promising. Examples are kernels computed by means of the Quantum Fourier Transform (QFT) and kernels defined via the calculation of ...
Massimiliano Incudini +2 more
wiley +1 more source
On Quasi Cycles in Hypergraph Databases
The notion of hypergraph cyclicity is important in numerous fields of application of hypergraph theory in computer science and relational database theory. The database scheme and query can be represented as a hypergraph.
Fayed F. M. Ghaleb +4 more
doaj +1 more source
The role of twins in computing planar supports of hypergraphs
A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over a classical standalone simulated annealing (SA). This scatter plot represents the comparison of QESA versus SA for the 924 graphs with the sizes N=60$N=60$, 80 and ...
Seokho Jeong, Juyoung Park, Jaewook Ahn
wiley +1 more source
Discrepancy of Sums of two Arithmetic Progressions
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time.
Hebbinghaus, Nils
core +1 more source
3-Zero-Divisor Hypergraph with Respect to an Element in Multiplicative Lattice
Let be a multiplicative lattice and be a proper element of . We introduce the3-zero-divisor hypergraph of with respect to which is a hypergraph whose vertices areelements of the set where distinct vertices and are adjacent, that is, is a hyperedge if and
Gülşen Ulucak
doaj +1 more source

