Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Kinetic_heap> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Kinetic_heap abstract "A Kinetic Heap is a kinetic data structure, obtained by the kinetization of a heap. It is designed to store elements (keys associated with priorities) where the priority is changing as a continuous function of time. As a type of kinetic priority queue, it maintains the maximum priority element stored in it. The kinetic heap data structure works by storing the elements as a tree that satisfies the following heap property - if B is a child node of A, then the priority of the element in A must be higher than the priority of the element in B. This heap property is enforced using certificates along every edge so, like other kinetic data structures, a kinetic heap also contains a priority queue (the event queue) to maintain certificate failure times.".
- Kinetic_heap thumbnail Kinetic_heap_overview.png?width=300.
- Kinetic_heap wikiPageID "35772150".
- Kinetic_heap wikiPageRevisionID "595783428".
- Kinetic_heap hasPhotoCollection Kinetic_heap.
- Kinetic_heap subject Category:Articles_created_via_the_Article_Wizard.
- Kinetic_heap subject Category:Heaps_(data_structures).
- Kinetic_heap subject Category:Kinetic_data_structures.
- Kinetic_heap comment "A Kinetic Heap is a kinetic data structure, obtained by the kinetization of a heap. It is designed to store elements (keys associated with priorities) where the priority is changing as a continuous function of time. As a type of kinetic priority queue, it maintains the maximum priority element stored in it.".
- Kinetic_heap label "Kinetic heap".
- Kinetic_heap sameAs m.0jwrm3y.
- Kinetic_heap sameAs Q6410783.
- Kinetic_heap sameAs Q6410783.
- Kinetic_heap wasDerivedFrom Kinetic_heap?oldid=595783428.
- Kinetic_heap depiction Kinetic_heap_overview.png.
- Kinetic_heap isPrimaryTopicOf Kinetic_heap.
