Results 121 to 130 of about 418 (155)

CHATGPT FOR COMPUTATIONAL TOPOLOGY. [PDF]

Found Data Sci
Liu J, Shen L, Wei GW.
europepmc   +1 more source

Joint multi-site domain adaptation and multi-modality feature selection for the diagnosis of psychiatric disorders. [PDF]

Neuroimage Clin
Ji Y, Silva RF, Adali T, Wen X, Zhu Q, Jiang R, Zhang D, Qi S, Calhoun VD.   +8 more
europepmc   +1 more source

AIFS: an efficient face recognition method based on AI and enhanced few-shot learning. [PDF]

Sci Rep
Nasralla MM.
europepmc   +1 more source

End-stage renal disease accompanied by mild cognitive impairment: A study and analysis of trimodal brain network fusion. [PDF]

PLoS One
Chen J, Liu T, Shi H.
europepmc   +1 more source

Supply chain network rewiring dynamics at the firm level. [PDF]

PNAS Nexus
Reisch T, Borsos A, Thurner S.
europepmc   +1 more source

Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity

Journal of Combinatorial Theory Series B, 2017
We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $k \ge 2$) on $n$ labeled vertices: $\mathbb G^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $\mathbb R^{(k)}(n,d)$, the random $d$-regular $k$-graph. We show that if $n\log n\ll m\ll n^k$ we can choose $d = d(n) \sim {km}/n$ and couple $\mathbb G^{(
Andrzej Rucinski, Matas Šileikis, Andrzej Dudek   +2 more
exaly   +4 more sources

An Algorithmic Regularity Lemma for Hypergraphs

SIAM Journal on Computing, 2000
Szemerédi's seminal ``regularity lemma'' is a powerful tool in extremal combinatorics and graph theory. Its algorithmic version (due to Alon et al.) has important applications to construct effective algorithms. This long and technically hard paper develops an analogous result for hypergraphs (which differs from other, earlier versions).
Andrzej Czygrinow, Vojtech Rödl
openaire   +2 more sources

On the Chromatic Number of Random Regular Hypergraphs

SIAM Journal on Discrete Mathematics
We estimate the likely values of the chromatic and independence numbers of the random $r$-uniform $d$-regular hypergraph on $n$ vertices for fixed $r$, large fixed $d$, and $n \rightarrow \infty$.
Alan Frieze
exaly   +3 more sources

List Colourings of Regular Hypergraphs

Combinatorics, Probability and Computing, 2012
We show that the list chromatic number of a simpled-regularr-uniform hypergraph is at least (1/2rlog(2r2) +o(1)) logdifdis large.
David Saxton, Andrew Thomason 0001
openaire   +1 more source

Regularity Lemma for k‐uniform hypergraphs

Random Structures & Algorithms, 2004
AbstractSzemerédi's Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasi‐randomness, Random Structures Algorithms 2 (1991), 241–252], Frankl and Rödl [The uniformity lemma for hypergraphs, Graphs Combin 8 (1992), 309–312; Extremal problems on ...
Vojtech Rödl, Jozef Skokan
openaire   +1 more source