Search results

{{short description|Measure of distance between vectors}} The '''Canberra distance''' is a numerical measure of the distance between pairs of points in a [[vector space]], introduced in 1966<ref>{{cit ...

...o the [[kinetic width]] data structure which maintains the pair of minimum-distance parallel lines that have the entire point set between them. In this case, s ...n a [[kinetic convex hull]] data structure, the merge of the four envelope lists in a [[kinetic sorted list]] and the boxes in a [[kinetic priority queue]]. ...

...et of moving points. The diameter of a set of moving points is the maximum distance between any pair of points in the set. In the two dimensional case, the kin ...t set, finding all pairs of antipodal points, and then finding the maximum distance between these pairs. This algorithm can be kinetized as follows: ...

...of elements in a data structure, finger search times are a function of the distance between the element and the finger. In a set of ''n'' elements, the distance ''d''(''x'',''y'') (or simply ''d'' when unambiguous) between two elements ...

...tary and solar attractions on a [[natural satellite]]. The term was coined by [[Isaac Asimov]] in ''The Magazine of Fantasy and Science Fiction'' in 1963 :'''d''' is the distance between the two bodies ...

...984|loc=Chapter VII}}, the '''classical Banach spaces''' are those defined by {{harvtxt|Dunford|Schwartz|1958}}, which is the source for the following ta * {{annotated link|Minkowski distance}} ...

...en two given words, it uses [[pointwise mutual information]] (PMI) to sort lists of important neighbor words of the two target words from a large [[Corpus l The method considers the words that are common in both lists and aggregate their PMI values (from the opposite list) to calculate the re ...

...f a tree, with edges labeled to show the order in which they are traversed by the tour]] ...ions to common problems in [[algorithmic graph theory]]. It was introduced by Tarjan and Vishkin in 1984.<ref name="Tarjan">{{Cite conference | last1 = T ...

{{Short description|Algorithm for searching sorted, infinite lists}} ...[[Andrew Chi-Chih Yao]] in 1976, for searching sorted, unbounded/infinite lists.<ref name=PaperBentley/> There are numerous ways to implement this, with th ...

In a recursive tree with <math>n</math> vertices, the vertices are labeled by the numbers from <math>1</math> to <math>n</math>, and the labels must decr Alternatively, a random recursive tree can be generated by starting from a single vertex, the root of the tree, labeled <math>1</math> ...

* The [[Basel problem]], solved by Euler in terms of <math>\pi</math>, asked for an exact expression for the s * The [[squared Euclidean distance]] between two points, equal to the sum of squares of the differences betwee ...

The graph induced by a well-separated pair decomposition can serve as a [[Graph spanner|k-spanne ...<math>\rho</math> containing it, such that the two spheres have a minimum distance of at least <math>s \rho</math>.<ref name="callahan-kosaraju">{{cite journa ...

...space, with the property that every element of the space is within a fixed distance of some codeword. such that the [[Hamming distance]] <math>d_H(x,y)\leq R</math>. ...

| parallax_footnote = <ref name=distance/> ...Trigonometric Parallaxes]], an older catalogue of ground-based parallaxes, lists the parallax as 20 ± 16 milliarcseconds, corresponding to about {{convert|2 ...

...gorithm can easily be used for solving the All-Pair-Shortest-Paths problem by executing the Single-Source variant with each node in the role of the root ...>d_v</math>. In <math>d_v</math>, the <math>i</math>-th element stores the distance from the root node <math>v</math> to the node <math>i</math>. ...

...ulti-criteria decision making]] (MCDM) method. It was originally developed by Serafim Opricovic in 1979 to solve decision problems with conflicting and n ...or Group Decision Problems", Management Science, 19(8), 936–946.</ref> and by Milan Zeleny.<ref>Milan Zelrny (1973) "Compromise Programming", in Cochrane ...

...tices of a given weighted graph are extracted in increasing order by their distance from the starting vertex, and a priority queue is used to determine the clo ...events at which the sweep line crosses a point of interest are prioritized by the coordinate of the crossed point, and these events are extracted in mono ...

{{See also|List of fractals by Hausdorff dimension|Fractal}} ...ed by the [[Euclidean distance|Euclidean metric]], which is itself induced by the [[Euclidean norm]]. ...

...ter than the particles it is moving through) the kinetic diameter is given by,<ref name=Ismail14>Ismail ''et al.'', p. 14</ref> The following table lists the kinetic diameters of some common molecules; ...

{{Short description|Abstract ruler in which some of the distance marks may be missing}} ...h>a_m</math> correspond to the ends of the ruler. In order to measure the distance <math>K</math>, with <math>0\le K\le L</math> there must be marks <math>a_i ...