Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Kinetic_tournament> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Kinetic_tournament abstract "A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of time. It is implemented analogously to a "tournament" between elements to determine the "winner" (maximum or minimum element), with the certificates enforcing the winner of each "match" in the tournament. It supports the usual priority queue operations - insert, delete and find-max. They are often used as components of other kinetic data structures, such as kinetic closest pair.".
- Kinetic_tournament thumbnail Kinetic_tournament_overview.png?width=300.
- Kinetic_tournament wikiPageExternalLink download?doi=10.1.1.41.2301&rep=rep1&type=pdf.
- Kinetic_tournament wikiPageID "35801324".
- Kinetic_tournament wikiPageLength "4139".
- Kinetic_tournament wikiPageOutDegree "22".
- Kinetic_tournament wikiPageRevisionID "607443666".
- Kinetic_tournament wikiPageWikiLink Binary_tree.
- Kinetic_tournament wikiPageWikiLink Category:Articles_created_via_the_Article_Wizard.
- Kinetic_tournament wikiPageWikiLink Category:Kinetic_data_structures.
- Kinetic_tournament wikiPageWikiLink Child_nodes.
- Kinetic_tournament wikiPageWikiLink Davenport-Schinzel_sequence.
- Kinetic_tournament wikiPageWikiLink Davenport–Schinzel_sequence.
- Kinetic_tournament wikiPageWikiLink File:Kinetic_tournament_overview.png.
- Kinetic_tournament wikiPageWikiLink Internal_node.
- Kinetic_tournament wikiPageWikiLink Kinetic_closest_pair.
- Kinetic_tournament wikiPageWikiLink Kinetic_data_structure.
- Kinetic_tournament wikiPageWikiLink Kinetic_heap.
- Kinetic_tournament wikiPageWikiLink Parent_node.
- Kinetic_tournament wikiPageWikiLink Priority_queue.
- Kinetic_tournament wikiPageWikiLink Tree_(data_structure).
- Kinetic_tournament wikiPageWikiLinkText "Kinetic tournament".
- Kinetic_tournament wikiPageWikiLinkText "kinetic tournament tree".
- Kinetic_tournament wikiPageWikiLinkText "kinetic tournament".
- Kinetic_tournament hasPhotoCollection Kinetic_tournament.
- Kinetic_tournament wikiPageUsesTemplate Template:Math.
- Kinetic_tournament wikiPageUsesTemplate Template:Refimprove.
- Kinetic_tournament wikiPageUsesTemplate Template:Reflist.
- Kinetic_tournament subject Category:Articles_created_via_the_Article_Wizard.
- Kinetic_tournament subject Category:Kinetic_data_structures.
- Kinetic_tournament hypernym Structure.
- Kinetic_tournament type Article.
- Kinetic_tournament type Building.
- Kinetic_tournament type Article.
- Kinetic_tournament type Structure.
- Kinetic_tournament comment "A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of time. It is implemented analogously to a "tournament" between elements to determine the "winner" (maximum or minimum element), with the certificates enforcing the winner of each "match" in the tournament. It supports the usual priority queue operations - insert, delete and find-max.".
- Kinetic_tournament label "Kinetic tournament".
- Kinetic_tournament sameAs m.0jwxxlt.
- Kinetic_tournament sameAs Q6410804.
- Kinetic_tournament sameAs Q6410804.
- Kinetic_tournament wasDerivedFrom Kinetic_tournament?oldid=607443666.
- Kinetic_tournament depiction Kinetic_tournament_overview.png.
- Kinetic_tournament isPrimaryTopicOf Kinetic_tournament.
