Zobrazeno 1 - 10
of 70 969
pro vyhledávání: '"Kautz, A"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we present a detailed study of the reach distance-layer structure of the De Bruijn and Kautz digraphs, and we apply our analysis to the performance evaluation of deflection routing in De Bruijn and Kautz networks. Concerning the distan
Externí odkaz:
http://arxiv.org/abs/2203.09918
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chaudhuri, Sayanti1 (AUTHOR) amsayanti@gmail.com, Dey, Debangshu1 (AUTHOR) debangshudey80@gmail.com, Munshi, Sugata1 (AUTHOR) sugatamunshi@yahoo.com
Publikováno v:
IETE Journal of Research. Dec2023, Vol. 69 Issue 12, p9251-9265. 15p.
Publikováno v:
IEEE Access, Vol 9, Pp 70924-70934 (2021)
This manuscript deals with the system identification of lightly (under) damped processes to find a suitable model structure. To identify such processes, the Kautz model, which is a two-parameter representation of orthogonal basis functions (OBF) in s
Externí odkaz:
https://doaj.org/article/3cd2943bdc3f4a0ab391347fcdd10e32
Autor:
Kaimanovich, Vadim A.
Publikováno v:
Unimodularity in randomly generated graphs, 129-154, Contemp. Math., 719, Amer. Math. Soc., Providence, RI, 2018
We suggest a new point of view on de Bruijn graphs and their subgraphs based on using circular words rather than linear ones.
Externí odkaz:
http://arxiv.org/abs/1812.01546
We consider the probabilistic group testing problem where $d$ random defective items in a large population of $N$ items are identified with high probability by applying binary tests. It is known that $\Theta(d \log N)$ tests are necessary and suffici
Externí odkaz:
http://arxiv.org/abs/1808.01457
Publikováno v:
In IFAC PapersOnLine 2020 53(2):536-541
Autor:
Dalfó, C.
The Kautz digraphs $K(d,\ell)$ are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related to these, the cyclic Kautz digraphs $CK(d,\ell)$ were recently introduced by B\"ohmov\'a, Huemer an
Externí odkaz:
http://arxiv.org/abs/1709.01882
Publikováno v:
Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science, vol 10765 (2018), 264-272
Let $G=(V,A)$ be a directed graph without parallel arcs, and let $S\subseteq V$ be a set of vertices. Let the sequence $S=S_0\subseteq S_1\subseteq S_2\subseteq\cdots$ be defined as follows: $S_1$ is obtained from $S_0$ by adding all out-neighbors of
Externí odkaz:
http://arxiv.org/abs/1612.01721