Results 241 to 250 of about 440,322 (281)

A prefrontal cortex map based on single-neuron activity. [PDF]

Nat Neurosci
Le Merre P, Heining K, Slashcheva M, Jung F, Moysiadou E, Guyon N, Yahya R, Park H, Wernstal F, Carlén M.   +9 more
europepmc   +1 more source

Maintaining diversity in structured populations. [PDF]

PNAS Nexus
Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA.   +5 more
europepmc   +1 more source

The topology of representational geometry. [PDF]

Front Neurosci
Brown S, Farivar R.
europepmc   +1 more source

Rabies Reemergence, Central Europe, 2022-2024. [PDF]

Emerg Infect Dis
Robardet E, Smreczak M, Orłowska A, Malik P, Nándori A, Dirbáková Z, Odaloš R, Rudoi O, Polupan I, Groza O, Arseniev S, Barbuceanu F, Vuta V, Picard-Meyer E.   +13 more
europepmc   +1 more source

Exploring the physiological limits of aging: a case study of the male 50-km world record in the 80+ age category. [PDF]

Front Physiol
Pilotto AM, Higueras-Liébana E, Ansaldo M, Baltasar-Fernandez I, Neri M, Giusti L, Buendía-Romero Á, Valenzuela PL, Alcazar J, Lauretani F, Re R, Botter A, Franchi MV, Ara I, Porcelli S.   +14 more
europepmc   +1 more source

Graph Convolutional Networks Enable Fast Hemorrhagic Stroke Monitoring With Electrical Impedance Tomography. [PDF]

IEEE Trans Biomed Eng
Toivanen J, Kolehmainen V, Paldanius A, Hanninen A, Hauptmann A, Hamilton SJ.   +5 more
europepmc   +1 more source

Memristance and transmemristance in multiterminal memristive systems

Milano G, Pilati D, Michieletti F, Cultrera A, Ricciardi C, Miranda E.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Cubic Distance-Regular Graphs

Journal of the London Mathematical Society, 1986
This paper completes the classification of cubic distance-regular graphs. We define the profile and period of certain cycles in such a graph, and obtain congruence conditions on the periods that help determine the feasible intersection arrays. It turns out that there are just 13 possible cases and in each case the array is realised by a unique graph.
Biggs, N.L., Boshier, A., Shawe-Taylor, J.   +2 more
openaire   +2 more sources

On Bounding the Diameter of a Distance-Regular Graph

Combinatorica, 2021
It is investigated how to use an initial portion of the intersection array of a distance-regular graph to give an upper bound for the diameter of the graph. In particular, three new diameter bounds are obtained. These bounds are tight for the Hamming \(d\)-cube, doubled odd graphs, the Heawood graph, Tutte's \(8\)-cage and \(12\)-cage, the generalized ...
Arnold Neumaier, Safet Penjic
openaire   +3 more sources