Results 71 to 80 of about 8,099 (222)
ABSTRACT Gliomas are aggressive brain tumors that require accurate imaging‐based diagnosis, where automated segmentation plays a central role in assessing tumor morphology and guiding treatment decisions. Manual delineation of gliomas is time‐consuming and prone to variability, motivating the use of deep learning to improve consistency and alleviate ...
Cecilia Diana‐Albelda +4 more
wiley +1 more source
CF‐SBERTHet: Collaborative and Textual Knowledge Enhanced Semantic Graphs for Sparse Recommendations
ABSTRACT Modern e‐commerce platforms face a critical challenge: delivering accurate recommendations under extreme user–item interaction sparsity, where textual context remains systematically underutilised. Existing collaborative filtering methods degrade sharply in sparse settings, while semantic approaches fail to capture collaborative patterns ...
He Ma +7 more
wiley +1 more source
The class M of finite manuals (i.e. hypergraphs formed by the cliques of finite graphs) is closed under the formation of sums and products. We define the class of constructible hypergraphs to be the smallest subclass of M which contains all finite ...
Christian Schindler +1 more
core +1 more source
07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs [PDF]
From 8th to 13th July 2007, the Dagstuhl Seminar ``Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Stege, Ulrike +3 more
core +1 more source
Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]
We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj +1 more source
We propose MSSM+, an extension of multiscale structural mapping (MSSM), together with surface supervertex mapping (SSVM) and a Supervertex Vision Transformer (SV‐ViT). Together, these methods exhibited better performance in detecting Alzheimer's disease and less variability across MR vendors than MSSM.
Geonwoo Baek +3 more
wiley +1 more source
Hypergraph coverings and Ramanujan Hypergraphs
In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$ and the spectrum of an incidence-signed hypergraph with $H$ as underlying hypergraph if $k=2 ...
Song, Yi-Min +2 more
openaire +2 more sources
Chromatic polynomials of hypergraphs
In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique.
Borowiecki, Mieczysław, Łazuka, Ewa
core +1 more source
Study on the reliability of hypergraphs based on non-backtracking matrix centrality
In recent years, there has been widespread attention on hypergraphs as a research hotspot in network science.The unique structure of hypergraphs, which differs from traditional graphs, is characterized by hyperedges that can connect multiple nodes ...
Hao PENG, Cheng QIAN, Dandan ZHAO, Ming ZHONG, Jianmin HAN, Ziyi XIE, Wei WANG
doaj +3 more sources
Two‐Round Ramsey Games on Random Graphs
ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source

