Search results

'''Complete spatial randomness''' ('''CSR''') describes a [[point process]] whereby point events occur wit ..., whereas in most other statistical contexts it is referred to the concept of a spatial Poisson process.<ref name="Omaimon2010DataM"/> ...

'''Static hashing''' is a form of [[Hash function|hashing]] where lookups are performed on a finalized dictio ...e2013">{{cite book | author = Daniel Roche | year = 2013 | title = SI486D: Randomness in Computing, Hashing Unit | publisher = United States Naval Academy, Compu ...

{{Short description|Extensions of the concept of randomness}} ...nguage=en}}</ref> This classification builds upon the three main states of randomness: mild, slow, and wild. ...

...xtractor that has been proven to produce truly random output from any type of weakly random source. ...neously keeping the seed length low. Intuitively, this means that as much randomness as possible has been "extracted" from the source. ...

{{Short description|Sequence of numbers consisting of 1 and -1}} {{about|sign sequences in mathematics|sequences of roadside signs|Burma-Shave}} ...

{{Short description|Cryptographical test for pseudo-randomness}} ...Computer Science, 1982.</ref> against pseudo-random sequences. A sequence of words passes Yao's test if an attacker with reasonable computational power ...

...n-of-dependent-dirichlet-processes-based-on-poisson-processes Construction of dependent Dirichlet processes based on compound Poisson processes], Neural ...is invalid for modelling temporal and spatial processes in which the order of data points plays a critical role in creating meaningful [[Cluster analysis ...

...''worst case''. By giving a security reduction to the worst-case scenario of a difficult mathematical problem, SWIFFT gives a much stronger security gua ...refore, its practical use would lie mostly in applications where the proof of collision-resistance is particularly valuable, such as digital signatures t ...

...of textures are often used to model surface or volumetric representations of natural elements such as [[wood]], [[marble]], [[granite]], [[metal]], [[ro ...hese functions are used as a [[Number|numerical]] representation of the "[[randomness]]" found in nature. ...

...and published in 2003 by the [[Cambridge University Press]], as volume 55 of the London Mathematical Society Student Texts book series. ...rk]]s, and the [[derandomization]] of [[randomized algorithm]]s. For these applications, the graph must be constructed explicitly, rather than merely having its ex ...

...upon bond]] prices, and in its most general form, today's prices for a set of caps, floors or European [[swaption]]s. The model was introduced by [[Fisch The main state variable of the model is the short rate, which is assumed to follow the stochastic diff ...

...iables and requires that this rate is essentially the same within a region of the [[parameter space]] being considered. ...h can be used to prove the [[convergence of random variables|convergence]] of [[extremum estimator]]s.<ref>{{cite journal |last=Newey |first=Whitney K. | ...

...finite set of binary strings. Consider model classes consisting of models of given maximal [[Kolmogorov complexity]]. ...The Kolmogorov structure function precisely quantifies the goodness-of-fit of an individual model with respect to individual data. ...

...A |s2cid=204836822 }}</ref> and (ii) understanding the universal structure of non-equilibrium and thermalization processes in quantum many-body dynamics. ...e <math>x</math> index specifies the lattice integer which connects a pair of qubits, and <math>\tau</math> is the time step. ...

...ounting algorithm]]s, the technique was later applied to a broad selection of [[Classification algorithm|classification]] and [[Regression analysis|regre ....g., counting the distinct elements of a stream), different randomizations of the algorithm (say, with different [[hash function]]s) should be used for r ...

...atch Randomized Matching Algorithm For Image Manipulation – Communications of the ACM |url=https://cacm.acm.org/research/the-patchmatch-randomized-matchi ...rk will be too hard to complete. So the following algorithm is done in a [[Randomness|randomized]] approach in order to accelerate the [[calculation]] speed. ...

...r, CS can be used to reconstruct a [[sparse vector]] from a smaller number of measurements, provided the signal can be represented in sparse [[Domain (ma ...a domain where only <math>{\it M}</math> [[Coefficient|coefficients]] out of <math>{\it N}</math> (where <math>{M \ll N}</math>) are non-zero, then the ...

...[[Authentication|authenticate]] users records, using the biometric inputs of the user as a key. ...n a biometric input.<ref>{{Cite web|title=Fuzzy Extractors: A Brief Survey of Results from 2004 to 2006 |url=https://www.cs.bu.edu/~reyzin/fuzzysurvey.ht ...

...s a generalization of the graph regularity method, which refers to the use of [[Szemerédi regularity lemma|Szemerédi's regularity]] and counting lemmas. ...ing lemma]] that estimates number of copies of a fixed graph as a subgraph of a larger graph. ...

...graph regularity and the multidimensional Szemerédi theorem|journal=Annals of Mathematics|volume=166|issue=3|pages=897–946|doi=10.4007/annals.2007.166.89 ...pergraphs isomorphic to <math>H</math> it is possible to remove all copies of <math>H</math> by removing at most <math>\varepsilon n^{r}</math> edges. ...