Results 201 to 210 of about 25,799 (301)

Anthropic Activity Markers 2.0: A Shift Towards Compositional Data Analysis. [PDF]

J Archaeol Method Theory
Ruiz-Giralt A, Biagetti S, Lancelotti C, Parque Ó, Koutroumpas A, Rix KS, Ibáñez-Insa J, Madella M.   +7 more
europepmc   +1 more source

Euclidean Distance Geometry

, 1982
Gower, J. C.
core  

A spatiotemporal single‐cell atlas of porcine development reveals regulatory dynamics and cellular targets of domestication

iMeta, EarlyView.
This study presents a cross‐tissue, single‐cell/single‐nucleus transcriptomic atlas spanning from prenatal to postnatal developmental stages in pig, characterizing 83 distinct cell types from 252,033 cells. Through the construction of cross‐tissue transcriptional regulatory networks and pseudotime trajectories, we revealed that organogenesis is driven ...
Rong Zhou, Zishuai Wang, Chenghao Hu, Shuhan Deng, Changyun Cai, Yanfang Wang, Shang‐Tong Li, Lijing Bai, Kui Li   +8 more
wiley   +1 more source

Multi-order hyperbolic graph convolution and aggregated attention for social event detection. [PDF]

PLoS One
Liu Y, Tan TP, Liu Z, Li Y.
europepmc   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

Video-based hand gesture recognition via SPD manifold spatial representation and optical flow motion features. [PDF]

PLoS One
Bai Z, Snášel V, Mirjalili S, Vo B, Pan JS, Kong L, Grosan C.   +6 more
europepmc   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon   +5 more
wiley   +1 more source

Multiscale SPD manifold learning for rehabilitation exercise evaluation. [PDF]

Sci Rep
Bai Z, Snášel V, Grosan C, Mirjalili S, Vo B, Pan JS, Kong L.   +6 more
europepmc   +1 more source