Results 21 to 30 of about 2,251 (141)

Multi-Modal Enhancement Transformer Network for Skeleton-Based Human Interaction Recognition [PDF]

Biomimetics
Skeleton-based human interaction recognition is a challenging task in the field of vision and image processing. Graph Convolutional Networks (GCNs) achieved remarkable performance by modeling the human skeleton as a topology.
Qianshuo Hu, Haijun Liu
doaj   +2 more sources

The existence of regular self-complementary 3-uniform hypergraphs

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Potočnik, Primož, Šajna, Mateja
openaire   +4 more sources

Generating self-complementary uniform hypergraphs

Discrete Mathematics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shonda Gosselin
openaire   +5 more sources

Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2022
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj   +1 more source

Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data- and Cognitive Scientists. [PDF]

Wiley Interdiscip Rev Cogn Sci
Cognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Haim E, Stella M.
europepmc   +2 more sources

Euler tours in hypergraphs [PDF]

, 2020
We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees.
Glock, Stefan, Joos, Felix, Kühn, Daniela, Osthus, Deryk   +3 more
core   +2 more sources

Academic team formation as evolving hypergraphs [PDF]

, 2010
This paper quantitatively explores the social and socio-semantic patterns of constitution of academic collaboration teams. To this end, we broadly underline two critical features of social networks of knowledge-based collaboration: first, they ...
A. J. Lott, A.-L. Barabási, B. F. Jones, B. Kogut, B. Latour, B. Uzzi, C. Jones, C. Roth, C. S. Wagner, Camille Roth, Carla Taramasco, D. Constant, D. Crane, D. de Beaver, D. E. Chubin, D. G. Ancona, D. N. Laband, D. Stokols, E. C. M. Noyons, E. Lazega, E. Leahey, G. F. Davis, G. Melin, G. Simmel, I. Karsai, J. D. Adams, J. G. Ruggie, J. J. Ramasco, J. Levrel, J. Moody, J. S. Katz, Jean-Philippe Cointet, K. A. Bollen, L. C. Freeman, M. A. Rodriguez, M. Callon, M. Callon, M. Callon, M. E. J. Newman, M. E. J. Newman, M. McPherson, M. McPherson, M. Ruef, M. Smangs, N. C. Mullins, N. E. Friedkin, P. Haas, P. Larédo, P. Larédo, R. E. Miles, R. Guimera, R. L. Breiger, R. R. Faulkner, R.L. Breiger, S. Wuchty, W. W. Powell   +55 more
core   +6 more sources

Vertex-transitive self-complementary uniform hypergraphs

European Journal of Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Potočnik, Primož, Šajna, Mateja
openaire   +2 more sources

A family of \(t\)-regular self-complementary \(k\)-hypergraphs

Transactions on Combinatorics, 2017
Summary: We use the recursive method of construction large sets of \(t\)-designs given by \textit{Q.-r. Wu} [Australas. J. Comb. 4, 229--235 (1991; Zbl 0763.05013)], and present a similar method for constructing \(t\)-subset-regular self-complementary \(k\)-uniform hypergraphs of order \(v\). As an application we show the existence of a new family of 2-
Ariannejad, Masoud, Emami, Mojgan, Naserian, Ozra   +2 more
openaire   +2 more sources

A hypergraph Tur\'an theorem via lagrangians of intersecting families [PDF]

, 2013
Let $\mc{K}_{3,3}^3$ be the 3-graph with 15 vertices $\{x_i, y_i: 1 \le i \le 3\}$ and $\{z_{ij}: 1 \le i,j \le 3\}$, and 11 edges $\{x_1, x_2, x_3\}$, $\{y_1, y_2, y_3\}$ and $\{\{x_i, y_j, z_{ij}\}: 1 \le i,j \le 3\}$.
Hefetz, Dan, Keevash, Peter
core   +1 more source