Results 91 to 100 of about 47,538 (182)
Engineering Reports, Volume 8, Issue 1, January 2026.This work tackles the unresolved stability problem of heterogeneous quaternion‐valued BAM neural networks plagued by unknown parameters, time‐varying delays, and impulses. By synergizing Lyapunov theory with inequality techniques, we establish rigorous, yet practical, global stability conditions.
Xi Long, Yaqin Li
wiley +1 more source
Transactions on Emerging Telecommunications Technologies, Volume 37, Issue 1, January 2026.IntelliMetro‐Hybrid is an intelligent fusion framework that integrates machine learning (ML) and deep learning (DL) for real‐time anomaly detection and economic optimization in smart metro systems. The model combines tree‐based feature extraction (Random Forest, XG Boost) with a deep neural classifier to effectively handle imbalanced, heterogeneous ...
Sijin Peng +6 more
wiley +1 more source
Beyond pairwise clustering [PDF]
, 2005 We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem.
Agarwal, Sameer +5 more
core +2 more sources
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard‐core model on bipartite expander graphs. Given a graph G$$ G $$ and λ>0$$ \lambda >0 $$, the hard‐core model on G$$ G $$ at activity λ$$ \lambda $$ is the probability distribution μG,λ$$ {\mu}_{G,\lambda } $$ on ...
Matthew Jenssen +2 more
wiley +1 more source
Discrepancy of Sums of two Arithmetic Progressions
, 2007 Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time.
Hebbinghaus, Nils
core +1 more source
The role of twins in computing planar supports of hypergraphs
, 2020 A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach
The Web Conference, 2019 Location Based Social Networks (LBSNs) have been widely used as a primary data source to study the impact of mobility and social relationships on each other.
Dingqi Yang +3 more
semanticscholar +1 more source
, 2022 Given a family S of five subsets of a 10-set, suppose |A△B|≥6 for all different A,B∈S. Prove that |A△B|=6 for all different A,B∈S.
openaire +1 more source
Hypergraph-Mlp: Learning on Hypergraphs Without Message Passing
ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)Hypergraphs are vital in modelling data with higher-order relations containing more than two entities, gaining prominence in machine learning and signal processing. Many hypergraph neural networks leverage message passing over hypergraph structures to enhance node representation learning, yielding impressive performances in tasks like hypergraph node ...
Tang, B, Chen, S, Dong, X
openaire +3 more sources