Caricamento...
Optimally selecting the top k values from X + Y with layer-ordered heaps
Selection and sorting the Cartesian sum, X + Y, are classic and important problems. Here, a new algorithm is presented, which generates the top k values of the form [Image: see text] . The algorithm relies on layer-ordered heaps, partial orderings of exponentially sized layers. The algorithm relies...
Salvato in:
| Pubblicato in: | PeerJ Comput Sci |
|---|---|
| Autore principale: | |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
PeerJ Inc.
2021
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC8114817/ https://ncbi.nlm.nih.gov/pubmed/34013031 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.7717/peerj-cs.501 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|