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 ...

...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|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 ...

{{Short description|Concept in geometric topology}} ...ond to 'assemble' local data over a parameter space together to get global data. ...

{{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 ...

{{Short description|Geometric structure on a smooth manifold}} ...'' is a certain kind of geometric structure on a [[smooth manifold]]. Such structures were introduced by [[Shigeo Sasaki]] in 1960. ...

...is | last1 = Rahmati | first1 = Zahed | title= Simple, Faster Kinetic Data Structures | publisher = University of Victoria | url= https://cs.uwaterloo.ca/~zrahm *[[Geometric spanner]] ...

...processing]], and [[autonomous systems]], where the spatial properties of data can be leveraged for both attack and defense.<ref>{{Cite arXiv |last1=Paper ...oit the high-dimensional space in which neural networks operate, revealing geometric vulnerabilities. ...

A '''kinetic triangulation''' data structure is a [[kinetic data structure]] that maintains a [[triangulation (geometry)|triangulation]] of The efficiency of a kinetic data structure is defined based on the ratio of the number of internal events to ...

...ed by the [[Intersection (set theory)|intersection]] of <math>X</math> and geometric shapes such as disks and axis-parallel rectangles. The goal is to select a ...same range space <math>\Sigma</math>, a closely related problem is the '''geometric hitting set problem''', where the goal is to select a ''minimum-size'' subs ...

{{Short description|Data analysis technique}} ...to be the counterpart of [[principal component analysis]] for categorical data.{{cn|date=October 2024}} MCA can be viewed as an extension of simple [[corr ...

...]], which is the branch of [[algorithm]]s devoted to solving problems of a geometric nature. This field includes problems from classic [[geometry]], like the [ ...ighbor Searching.'' Journal of the ACM, 57(1): 1-54, 2009</ref> based on a data structure called the [[Approximate Voronoi Diagram|AVD]] (or approximate [[ ...

{{Short description|Tree data structure}} In [[computer science]], '''M-trees''' are [[tree data structure]]s that are similar to [[R-tree]]s and [[B-tree]]s. It is constru ...

...roximability]].{{r|appointed}} She holds the chair for Algorithms and Data Structures in the Computer Science Department at [[Heinrich Heine University Düsseldor | title = Turning big data into tiny data: Constant-size coresets for {{nowrap|<math>k</math>-means,}} PCA, and proje ...

...tree]]s have a constant competitive ratio, but this remains unproven. The geometric view of binary search trees provides a different way of understanding the p ==Translation to a geometric point set== ...

...plicial set. [[File:Circle_structures.svg|thumb|440x440px|Three Delta-set structures on the circle, with the third also being a simplicial complex.]]As an examp ==Definition and related data== ...

...persistent [[Homology (mathematics)|homology]] computations on point cloud data.<ref name=":0">{{Cite arXiv |last1=Lesnick |first1=Michael |last2=Wright |f ...DA) to associate a sequence of nested [[simplicial complex]]es to a finite data set in order to detect the persistence of [[topological]] features over a r ...

...oceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81 |chapter=The K-D-B-tree |year=1981|pages=10–18|doi=10.1145/582 ...a. The reorganization algorithm to be used when a page contains too little data is as follows: ...

| title = The ordering of multivariate data ...and the convex layers themselves are the depth contours for this notion of data depth.<ref>{{citation ...