DeepAI AI Chat
Log In Sign Up

Optimal construction of a layer-ordered heap

07/27/2020
by   Jake Pennington, et al.
0

The layer-ordered heap (LOH) is a simple, recently proposed data structure used in optimal selection on X+Y, thealgorithm with the best known runtime for selection on X_1+X_2+⋯+X_m, and the fastest method in practice for computing the most abundant isotope peaks in a chemical compound. Here, we introduce a few algorithms for constructing LOHs, analyze their complexity, and demonstrate that one algorithm is optimal for building a LOH of any rank α. These results are shown to correspond with empirical experiments of runtimes when applying the LOH construction algorithms to a common task in machine learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/30/2020

Optimal selection on X+Y simplified with layer-ordered heaps

Selection on the Cartesian sum, A+B, is a classic and important problem....
04/16/2020

Fast exact computation of the k most abundant isotope peaks with layer-ordered heaps

The theoretical computation of isotopic distribution of compounds is cru...
10/26/2019

Selection on X_1+X_2+... + X_m with layer-ordered heaps

Selection on X_1+X_2+... + X_m is an important problem with many applica...
08/16/2020

Selection on X_1 + X_1 + ⋯ X_m via Cartesian product tree

Selection on the Cartesian product is a classic problem in computer scie...
03/09/2018

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon

The geodesic Voronoi diagram of m point sites inside a simple polygon of...
04/20/2020

The new methods for equity fund selection and optimal portfolio construction

We relook at the classic equity fund selection and portfolio constructio...
02/25/2023

Isolated Suborders and their Application to Counting Closure Operators

In this paper we investigate the interplay between isolated suborders an...