Results 181 to 190 of about 698,372 (216)

A hypergraph convolution-based intelligent healthcare platform for aging population management. [PDF]

Front Public Health
Li W, Hou B, Wang XX.
europepmc   +1 more source

YOLOv13-ADR: An Adaptive Deformable Convolution and Neighborhood-Aware Recombination Network for Wind Turbine Blade Defect Detection. [PDF]

Sensors (Basel)
Wang X, Shahzad MM, Yang S, Wang T, Wang Z.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Laplacian of a uniform hypergraph

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liqun Qi, Shenglong Hu
exaly   +3 more sources

The Uniformity Lemma for hypergraphs

Graphs and Combinatorics, 1992
This is an extension of Szemerédi's theorem called the Uniformity Lemma for Graphs (see \textit{E. Szemerédi} [Problèmes combinatoires et théorie des graphes, Orsay 1976, Colloq. int. CNRS No. 260, 399-401 (1978; Zbl 0413.05055)]) to \(r\)-uniform hypergraphs. Two applications of the result are announced: proof of a conjecture of Erdős concerning Turán-
Peter Frankl, Vojtech Rödl
openaire   +3 more sources

Non-uniform hypergraphs

2020
Summary: Non-uniform hypergraphs are a generalization of hypergraphs in which not all edges need to have the same cardinality. It allows them to support a more complex data structure. In this paper, we extend some results for non-uniform hypergraphs and generalize the spectral results for uniform hypergraphs to non-uniform hypergraphs.
SHIRDEL, G.H., MORTEZAEE, A., GOLPAR-RABOKY, E.   +2 more
openaire   +2 more sources

On the capacity of uniform hypergraphs

IEEE Transactions on Information Theory, 1990
The capacity of uniform hypergraphs can be defined as a natural generalization of the Shannon capacity of graphs. Corresponding to every uniform hypergraph there is a discrete memoryless channel in which the zero error capacity, in the case of the smallest list size for which it is positive, equals the capacity of the hypergraph, and vice versa.
KORNER, JANOS, Katalin Marton
openaire   +3 more sources

On the Turán Density of Uniform Hypergraphs

Acta Mathematicae Applicatae Sinica, English Series, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, An, Gao, Guo-rong
openaire   +2 more sources

Approximate coloring of uniform hypergraphs

Journal of Algorithms, 2003
Summary: We consider an algorithmic problem of coloring \(r\)-uniform hypergraphs. The problem of finding the exact value of the chromatic number of a hypergraph is known to be NP-hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any \(r\geq 3\) it is ...
Michael Krivelevich, Benny Sudakov
openaire   +1 more source

Learning a hidden uniform hypergraph

Optimization Letters, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih   +2 more
openaire   +3 more sources