Results 71 to 80 of about 8,099 (222)

GBT‐SAM: A Parameter‐Efficient Depth‐Aware Model for Generalizable Brain Tumor Segmentation on mp‐MRI

open access: yesInternational Journal of Imaging Systems and Technology, Volume 36, Issue 4, July 2026.
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

open access: yesExpert Systems, Volume 43, Issue 7, July 2026.
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

Constructible hypergraphs

open access: yes, 1991
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]

open access: yes, 2007
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]

open access: yesDiscrete Mathematics & Theoretical Computer Science
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

Improved Multiscale Structural Mapping with Supervertex Vision Transformer for the Detection of Alzheimer's Disease Neurodegeneration

open access: yesHuman Brain Mapping, Volume 47, Issue 8, June 1, 2026.
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

open access: yes, 2023
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

open access: yes, 2000
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

open access: yes网络与信息安全学报
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

open access: yesRandom Structures &Algorithms, Volume 68, Issue 3, May 2026.
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

Home - About - Disclaimer - Privacy