Binary heap

Known as: Heap tree, Binary min heap, Binary min-heap

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. A binary…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Existing Searchable Encryption (SE) solutions are able to handle simple Boolean search queries, such as single or multi-keyword…

2011

In this paper, a new method is proposed for image encryption using chaotic signals and Max-heap tree. In this method, Max-heap…

2011

With its long endurance, high safety and low signature, an Unmanned Aerial Vehicle (UAV) plays a great part in intelligence…

2010

— Grid computing is a group of clusters connected over high-speed networks that involves coordinating and sharing computational…

2010

Graphics processors are becoming more and more popular among many application developers as commodity data-parallel coprocessors…

2008

— In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is…

2007

The generation of frequent itemsets is an essential and time-consuming step in mining association rules. Most of the studies…

1996

This paper describes reconfigurable massively parallel computer system called SOP (Sea Of Processors) that has ability to change…

1989

In this paper we show that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n…

1987

Very recently a new data structure, called a min-max heap, was presented for implementing the double-ended priority queue. A min…