Correctness of Data Representations involving Heap Data Structures by Reddy, U, Yang, H

Correctness of Data Representations involving Heap Data Structures by Reddy, U, Yang, H

A Selectable Sloppy Heap by Adrian Dumitrescu

“…As such, our data structure outperforms the soft heap data structure of Chazelle (which only offers constant amortized complexity for a fixed error rate 0 < ε ≤ 1 / 2 ) in applications such as dynamic percentile maintenance. …”
Get full text

On Frequency Estimation and Detection of Frequent Items in Time Faded Streams by Massimo Cafaro, Italo Epicoco, Marco Pulimeno, Giovanni Aloisio

“…The use of the quasi-heap data structure slows down the algorithm owing to the huge number of maintenance operations. …”
Get full text

An Improved Similarity-Based Clustering Algorithm for Multi-Database Mining by Salim Miloudi, Yulin Wang, Wenjia Ding

“…By using a max-heap data structure within our CD algorithm, we optimally choose the largest weight variable <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msubsup><mi>θ</mi><mrow><mi>p</mi><mo>,</mo><mi>q</mi></mrow><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></msubsup></semantics></math></inline-formula> at each iteration <i>i</i> such that taking the partial derivative of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">L</mi><mo>(</mo><mi>θ</mi><mo>)</mo></mrow></semantics></math></inline-formula> with respect to <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msubsup><mi>θ</mi><mrow><mi>p</mi><mo>,</mo><mi>q</mi></mrow><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></msubsup></semantics></math></inline-formula> allows us to attain the next steepest descent minimizing <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">L</mi><mo>(</mo><mi>θ</mi><mo>)</mo></mrow></semantics></math></inline-formula> without using a learning rate. …”
Get full text

Automatic model learning and its applications in malware detection by Hao, Xiao

“…The second approach inherits limitations from symbolic execution, which lacks capability in handling commonly used program features such as heap data structures and program loops. To circumvent the problems in the first and second approaches, the third approach harvests the experiences of existing example programs which use the program library to learn behavior models. …”
Get full text