Search results

{{short description|Distributed computing model}} ...revious state, and the result of the computation can be read in the states of the agents once the computation has [[convergence (mathematics)|converged]] ...

...d [[Derrick Henry Lehmer]]) is an [[algorithm]] that computes exact values of the [[prime-counting function]].<ref name="lehmer" /><ref name="lagarias-mi ...es from [[Adrien-Marie Legendre | Legendre]]. He observed from the [[Sieve of Eratosthenes]] that ...

...re each given a (potentially different) string, what is the minimal number of bits that they need to exchange in order for Alice to approximately compute ...Andrew|date=2010|title=A Near-optimal Algorithm for Estimating the Entropy of a Stream|journal= ACM Transactions on Algorithms|volume=6|issue=3|pages=1–2 ...

...f a [[Reuleaux triangle]] and its reflection across the center of symmetry of the subset]] ...ntral symmetry|centrally symmetric]] it is. It is the fraction of the area of the set that can be covered by its largest centrally symmetric subset.{{r|g ...

...007379|series=STOC '04|location=Chicago, IL, USA|publisher=Association for Computing Machinery|pages=128–137|doi=10.1145/1007352.1007379|isbn=978-1-58113-852-8| ...2020/12060/pdf/LIPIcs-TQC-2020-1.pdf|journal=15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)|series=Leibn ...

...as the '''naive vertex classification''', or the '''1-dimensional version of the [[Weisfeiler Leman graph isomorphism test|Weisfeiler-Leman algorithm]]' ...raph into some set (of "colours"). In each iteration, we define a sequence of vertex colourings <math> \lambda_i </math> as follows: ...

...of these functions. More formally, the subject of size theory is the study of the [[natural pseudodistance]] between [[size pair]]s. A survey of size theory can be found in ...

{{about|a theoretical model for parallel algorithms|the general concept of computing with many parallel devices|massively parallel}} ...a theoretical model of computing, intended as an abstraction for parallel computing systems that use frameworks such as [[MapReduce]], and frequently applied t ...

...ted densities are then both 0.10. However, the population weighted density of the first region is greater as its population is grouped in a single parcel ...-weighted density''' is an alternate metric for the [[population density]] of a region that attempts to measure the density as experienced by the average ...

...cation=London | publisher=Jhon Kyngstone<!---spelling obtained from page 1 of the pdf file, confirmed by https://books.google.de/books?id=Clu3BgAAQBAJ&pg ...nglish to use the [[plus and minus signs]].<ref>{{citation|title=A History of Mathematical Notations|first=Florian|last=Cajori|authorlink=Florian Cajori| ...

{{Short description|BOINC Account Manager for volunteer computing projects}} | industry = [[Volunteer computing]] ...

...ble.<ref name="Dark_Reading"/> Its chief application is the investigation of [[Insider threat|insider]] [[data theft]].<ref name="J_Digital_Investigatio ==History== ...

{{Short description|Class of algorithms in information theory}} ...ethod|iterative algorithms]] that eventually converge to one of the maxima of the [[optimization problem]] that is associated with these information theo ...

...umb|Oresme's geometric verification of the Oxford Calculators' Merton Rule of uniform acceleration, or mean speed theorem.]] ...ight|[[Galileo]]'s demonstration of the law of the space traversed in case of uniformly varied motion. It is the same demonstration that [[Oresme]] had m ...

...ize, they both set the elements in their copy of the vector to the maximum of the element across both counters: <math>V_a[x] = V_b[x] = \max(V_a[x], V_b ...r equal to its corresponding element in <math>V_b</math>, and at least one of the elements is strictly less than. If neither <math>a < b</math> or <math ...

...date=September 1973|title=A Method of Computing Spherical Bessel Functions of Complex Argument with Tables|url=https://apps.dtic.mil/sti/pdfs/AD0767223.p == History == ...

{{Short description|Statistical rule of thumb}} ...tion lies between the smallest and largest values in any [[random sample]] of five taken from that population. ...

{{Short description|Method of graph analysis}} '''Differentially private analysis of graphs'''<ref>{{cite journal ...

...TH_1878" retrieved="09/09/2024"</ref><ref>Leonard Eugene Dickson, "History of Numbers", vol 2, pp. 382–384.</ref> The algorithm does not require the factorization of the modulus, and uses modular operations that are often easy when the given ...

...processors. Only the original WW-Warp forced a truly lock step sequencing of stages, which severely restricted its programmability but was in a sense th == History == ...