Results 51 to 60 of about 4,035 (167)
ABSTRACT The accurate and early detection of kidney stones is crucial for effective treatment and patient management. This study presents a hybrid machine learning approach combining Support Vector Machines (SVM) and Convolutional Neural Networks (CNN) for the multi‐classification of kidney stones.
Setlhabi Letlhogonolo Rapelang +1 more
wiley +1 more source
On the Replica Symmetric Solution in General Diluted Spin Glasses
ABSTRACT We present a unifying approach to studying the replica symmetric solution in general diluted spin glass models on random p$$ p $$‐uniform hypergraphs with sparsity parameter α$$ \alpha $$. Our result shows that there exist two key regimes in which the model exhibits replica symmetry and the free energy can be explicitly represented as the ...
Ratul Biswas, Wei‐Kuo Chen, Arnab Sen
wiley +1 more source
Total weight choosability in Hypergraphs [PDF]
A total weighting of the vertices and edges of a hypergraph is called vertex-coloring if the total weights of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this note
Pfender, Florian
core
Conflict-Free Coloring Made Stronger
In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is, it can be colored with $O(\log n)$ colors such that for any (covered) point $p$ there is some disc ...
A. Bar-Noy +10 more
core +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
Conflict-Free Coloring of Intersection Graphs of Geometric Objects
In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied since then. A
Keller, Chaya, Smorodinsky, Shakhar
core +1 more source
The existence of subspace designs
Abstract We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility conditions. This settles an open problem from the 1970s.
Peter Keevash +2 more
wiley +1 more source
Constructions of sparse uniform hypergraphs with high chromatic number [PDF]
AbstractA random construction gives new examples of simple hypergraphs with high chromatic number that have few edges and/or low maximum degree. In particular, for every integers k ≥ 2, r ≥ 2, and g ≥ 3, there exist r‐uniform non‐k‐colorable hypergraphs of girth at least g with maximum degree at most ⌈r kr‐1 lnk⌉.
van der Hofstad, R. +2 more
openaire +18 more sources
Optimizing Staircase Motifs in Biofabric Network Layouts
Abstract Biofabric is a novel method for network visualization, with promising potential to highlight specific network features. Recent studies emphasize the importance of staircase motifs — equivalent to fans or stars in node‐link diagrams — within Biofabric.
Sara Di Bartolomeo +2 more
wiley +1 more source
Forensic linguistics and stylometry have in the exploration of linguistic patterns one of their fundamental tools. Mathematical structures such as complex multilayer networks and hypergraphs provide remarkable resources to represent and analyze texts.
Ángeles Criado‐Alonso +3 more
wiley +1 more source

