A carregar...
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...
Na minha lista:
| Publicado no: | PeerJ Comput Sci |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
PeerJ Inc.
2021
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC8093990/ https://ncbi.nlm.nih.gov/pubmed/33987456 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.7717/peerj-cs.483 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|