Results 131 to 140 of about 418 (155)
Some of the next articles are maybe not open access.
Regularity lemmas for hypergraphs and quasi‐randomness
Random Structures & Algorithms, 1991AbstractWe give a simple proof for Szemerédi's Regularity Lemma and its generalization for k‐uniform hypergraphs. For fixed k, there are altogether k ‐1 different versions of the regularity lemma for k‐uniform hypergraphs. The connection between regularity lemmas for hypergraphs and quasi‐random classes of hypergraphs is also investigated.
openaire +2 more sources
Regular Representation of Finite Groups by Hypergraphs
Canadian Journal of Mathematics, 1978All structures considered in this paper will be finite.The product στ of two permutations σ and τ of a set V is defined by στ(x) = στ(X)) for every x ∈ V. The set Sv of all permutations of F is a group under this operation. A permutation group on F is a subgroup of Sv.
Foldes, Stephane, Singhi, Navin M.
openaire +2 more sources
Hypergraph regularized sparse feature learning
Neurocomputing, 2017As an important pre-processing stage in many machine learning and pattern recognition domains, feature selection deems to identify the most discriminate features for a compact data representation. As typical feature selection methods, Lasso and its variants using the l1-norm based regularization have received much attention in recent years.
Mingxia Liu 0001 +3 more
openaire +1 more source
An Edge Ordering Problem of Regular Hypergraphs
2006Given a pair of integers 2≤s ≤k, define g s (k) to be the minimum integer such that, for any regular multiple hypergraph H =({1, ..., k}, {e 1, ..., e m }) with edge size at most s, there is a permutation π on {1, ..., m} (or edge ordering e π(1), ..., e \(_{\pi({\it m})}\))such that \(g(H, \pi) =\max\{ \max \{|d_{H_j}(u) - d_{H_j}(v)| : u, v\in e_{\pi(
Hongbing Fan, Robert Kalbfleisch
openaire +1 more source
3-regular hypergraphs that are decomposable and threshold.
Ars Comb., 2003A 3-uniform hypergraph \(H=(V,E)\) is called threshold if, for a function \(w\: V\to {\mathbb N}\) and an integer \(t>0\), a set \(X\subset V\) is stable if and only if \(\sum _{x\in X}w(x)\leq t\), and it is called edge-threshold if \(\{x,y,z\}\subset V\) is an edge if and only if \(w(x)+w(y)+w(z)>t\).
Margaret Ann Francel, David J. John
openaire +1 more source
Various Regularity Lemmas in Graphs and Hypergraphs
2013We are going to formulate and discuss the philosophy of these lemmas and their applications in property testing and at the designing polynomial time approximation schemes for certain graph problems.
openaire +1 more source
Hypergraph Learning: Methods and Practices
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Zizhao Zhang, Changqing Zou, Yue Gao
exaly
Hypergraph convolution and hypergraph attention
Pattern Recognition, 2021Song Bai, Feihu Zhang
exaly
Hypergraph regularity and quasi-randomness
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009Brendan Nagle +3 more
openaire +1 more source
Regular Behavior of the Maximal Hypergraph Chromatic Number
SIAM Journal on Discrete Mathematics, 2020Fedor Petrov, Danila Cherkashin
exaly