Search results

{{Short description|Kinetic data structure}} ...sed as a basis for a responsive, compact and efficient kinetic minimum box data structure. ...

...esponsive]], [[kinetic data structure#Performance#|compact]] and [[Kinetic data structure#Performance|efficient]]. ...pdated. The upper and lower envelopes can be maintained using the standard data structure for [[kinetic convex hull]]. The maximum distance between pairs o ...

{{Infobox data structure | type = [[Heap (data structure)|Heap]]/[[priority queue]] ...

{{Infobox algorithm|class=[[Sorting Algorithm]]|data=[[Array data structure|Array]]|space=<math>O(n+max)</math>|time=<math>O(n+max)</math>}} It uses advanced data structures to improve speed in sorting. It is an integer sorting algorithm. It takes i ...

Key-independent optimality is a property of some [[binary search tree ]] data structures in [[computer science]] Suppose that [[Attribute–value pair|key-value pairs]] are stored in a data ...

...responsive]], [[Kinetic data structure#Performance|compact]] and [[Kinetic data structure#Performance|efficient]]. ...iately. The upper and lower envelopes can be maintained using the standard data structure for [[kinetic convex hull]]. The minimum distance between edge-po ...

{{Short description|Kinetic data structure}} ...redecessor data structure, and as a component in more complex kinetic data structures such as [[kinetic closest pair]]. ...

{{Short description|Kinetic data structure}} A '''kinetic minimum spanning tree''' is a [[kinetic data structure]] that maintains the [[minimum spanning tree]] (MST) of a graph w ...

{{Short description|Data structure}} ...and ''find-max''. They are often used as components of other kinetic data structures, such as [[kinetic closest pair]]. ...

...nment, iteration and composition instructions and from the axioms of the [[data structure]]s in question see {{harvtxt|Mirkowska|Salwicki|1987}}, {{harvtxt ...ogic)|Terms]]'' - i.e. expressions denoting operations on elements of data structures, ...

{{Short description|Data structures used to track continuously moving geometric bodies}} ...ame="JBasch">{{Cite thesis |last1=Basch |first1=Julien |title=Kinetic Data Structures |publisher=Stanford University |url=http://www.basch.org/phdthesis |year=19 ...

...a generalization of the [[Heap (data structure)|Heap]].<ref>Advanced Data Structures, Peter Brass, {{ISBN|978-0-521-88037-4}}, page 270</ref> It allows for effi [[Category:Heaps (data structures)]] ...

In [[computer science]], a '''doubly logarithmic tree''' is a [[Tree (data structure)|tree]] where each internal node of height 1, the tree layer abov ...he-Oblivious Sorting]. Notes for MIT Computer Science 6.897: Advanced Data Structures. ...

{{Short description|Compressed data structure for pattern matching}} ...ffix array]].<ref name="GV00"/><ref name="opportunistic_2000"/> These data structures enable quick search for an arbitrary [[String (computer science)|string]] w ...

{{Infobox algorithm|class=[[Sorting Algorithm]]|data=[[Array data structure|Array]]|space=<math>O(n+max)</math>|time=<math>O(n+max)</math>}} It uses advanced data structures to improve speed in sorting. It is an integer sorting algorithm. It takes i ...

...SE) and other [[algorithm]]s that can be efficiently executed on encrypted data. ...information about the data or queries can be recovered from the encrypted data structure and tokens beyond a well-specified and "reasonable" leakage profi ...

...tree accumulation''' is the process of accumulating data placed in [[Tree (data structure)|tree]] nodes according to their [[Tree (data structure)|tree]] structure.<ref>{{cite thesis |type=Ph.D. |first=Jeremy |l ...

=== Data structures === Each process maintains one data structure: ...

{{Short description|Data structure for anagram solving}} ...|volume=17|issue=1 |pages=2012 |doi=10.1145/2133803.2133804}}</ref> is a [[data structure]] designed to solve [[anagram]]s. Solving an anagram is the probl ...

A '''kinetic smallest enclosing disk''' data structure is a [[kinetic data structure]] that maintains the [[Smallest circle problem|smallest enclosing ...he point set as its diameter. Thus, by maintaining the [[Kinetic diameter (data)|kinetic diameter]] of the point set, the farthest-point delaunay triangula ...