Cargando…
Selection on X(1) + X(2) + ⋯ + X(m) via Cartesian product trees
Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on A + B, based on soft heaps, was introduced. By combining this approach with layer-ordered heaps (LOHs), an algorithm using a balanced binary tree of A + B selections was propo...
Autores principales: | Kreitzberg, Patrick, Lucke, Kyle, Pennington, Jake, Serang, Oliver |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8093990/ https://www.ncbi.nlm.nih.gov/pubmed/33987456 http://dx.doi.org/10.7717/peerj-cs.483 |
Ejemplares similares
-
Optimally selecting the top k values from X + Y with layer-ordered heaps
por: Serang, Oliver
Publicado: (2021) -
X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution
por: Liu, Genggeng, et al.
Publicado: (2021) -
Splitting ore from X-ray image based on improved robust concave-point algorithm
por: Wang, Lanhao, et al.
Publicado: (2023) -
Semi-supervised oblique predictive clustering trees
por: Stepišnik, Tomaž, et al.
Publicado: (2021) -
Comparison of the performance of skip lists and splay trees in classification of internet packets
por: Khezrian, Navid, et al.
Publicado: (2019)