log length
101Benford's law — Benford s law, also called the first digit law, states that in lists of numbers from many real life sources of data, the leading digit is distributed in a specific, non uniform way. According to this law, the first digit is 1 almost one third of… …
102Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… …
103Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
104Directional statistics — is the subdiscipline of statistics that deals with directions (unit vectors in Rn), axes (lines through the origin in Rn) or rotations in Rn. More generally, directional statistics deals with observations on compact Riemannian manifolds. The… …
105Work hardening — Work hardening, also known as strain hardening or cold working, is the strengthening of a metal by plastic deformation. This strengthening occurs because of dislocation movements within the crystal structure of the material.[1] Any material with… …
106von Mises distribution — von Mises Probability density function The support is chosen to be [ π,π] with μ=0 Cumulative distribution function The support is chosen to be [ π,π] with μ=0 …
107Film speed — is the measure of a photographic film s sensitivity to light, determined by sensitometry and measured on various numerical scales, the most recent being the ISO system. A closely related ISO system is used to measure the sensitivity of digital… …
108Patience sorting — is a sorting algorithm, based on a solitaire card game, that has the property of being able to efficiently compute the length of the longest increasing subsequence in a given array.The card gameThe game begins with a shuffled deck of cards,… …
109Haldensortierung — Der Heapsort Algorithmus beim Sortieren eines Arrays aus permutierten Werten. Der Algorithmus besteht aus zwei Schritten; im vorbereitenden Schritt wird das Array zu einem binären Heap umgeordnet, dessen Baumstruktur vor dem eigentlichen… …
110Heap-Sort — Der Heapsort Algorithmus beim Sortieren eines Arrays aus permutierten Werten. Der Algorithmus besteht aus zwei Schritten; im vorbereitenden Schritt wird das Array zu einem binären Heap umgeordnet, dessen Baumstruktur vor dem eigentlichen… …
