Zobrazeno 1 - 10
of 326 995
pro vyhledávání: '"Heaps"'
Autor:
Schoenmakers, Berry
Publikováno v:
Principles of Verification: Cycling the Probabilistic Landscape, Part I, LNCS 15260, Springer 2024, pp. 73-84
Leftist heaps and skew heaps are two well-known data structures for mergeable priority queues. Leftist heaps are constructed for efficiency in the worst-case sense whereas skew heaps are self-adjusting, designed for efficiency in the amortized sense.
Externí odkaz:
http://arxiv.org/abs/2411.11051
It is a classical result due to Jacobi in algebraic combinatorics that the generating function of closed walks at a vertex $u$ in a graph $G$ is determined by the rational function \[ \frac{\phi_{G-u}(t)}{\phi_G(t)} \] where $\phi_G(t)$ is the charac
Externí odkaz:
http://arxiv.org/abs/2411.03567
Granular heaps are critical in both industrial applications and natural processes, exhibiting complex behaviors that have sparked significant research interest. The stress dip phenomenon observed beneath granular heaps continues to be a topic of sign
Externí odkaz:
http://arxiv.org/abs/2408.17147
Publikováno v:
Journal of Theoretical Biology (2024)
Heaps' or Herdan's law is a linguistic law describing the relationship between the vocabulary/dictionary size (type) and word counts (token) to be a power-law function. Its existence in genomes with certain definition of DNA words is unclear partly b
Externí odkaz:
http://arxiv.org/abs/2405.13825
Autor:
Peng, Zhijun1 pengzhijun@tju.edu.cn, Sun, Han2 13920613468@163.com, Tao, Wenyuan3 taowenyuan@tju.edu.cn, Wang, Haoyu4 1006175898@qq.com, Kang, Qibin5 kangqibin@tju.edu.cn, Xu, Wenguang6 201609013@stu.jiangnan.edu.cn, Zeng, Fanyue7 437118746@qq.com, Lin, Chenzheng8 964166580@qq.com
Publikováno v:
Leonardo. Jun2023, Vol. 56 Issue 3, p272-278. 7p.
Autor:
Chingono, Paidamoyo Hazel1, Sadr, Karim1 karim.sadr@wits.ac.za
Publikováno v:
African Archaeological Review. Mar2023, Vol. 40 Issue 1, p73-87. 15p.
Autor:
Szymankiewicz, Karol1 (AUTHOR) karol.szymankiewicz@kobize.pl, Posyniak, Michał2,3 (AUTHOR) michal.posyniak@kit.edu, Markuszewski, Piotr4,5,6 (AUTHOR) pmarkusz@iopan.pl, Durka, Paweł1 (AUTHOR)
Publikováno v:
Remote Sensing. Jul2024, Vol. 16 Issue 13, p2447. 22p.
Autor:
Shigechi, Keiichi
We study heaps of pieces for lattice paths, which give a combinatorial visualization of lattice paths. We introduce two types of heaps: type $I$ and type $II$. A heap of type $I$ is characterized by peaks of a lattice path. We have a duality between
Externí odkaz:
http://arxiv.org/abs/2401.12701
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.