Search results

{{short description|Multiple comparisons correction}} ...ák correction''', is a method used to counteract the problem of [[multiple comparisons]]. It is a simple method to control the [[family-wise error rate]]. When a ...

...el]]s, [[Gaussian random field]]s, machine learning, big data, statistical computing, graphics, and applications in [[biostatistics]], biomedical research, [[Bu ...also became an [[American Statistical Association|ASA]]/[[Association for Computing Machinery|ACM]]/[[American Mathematical Society|AMS]]/[[Institute of Mathem ...

...nterest in connection with the problem of sorting with a minimum number of comparisons.{{r|distrib}} The same algorithm may have also been independently discovere ...cription in {{harvtxt|Knuth|1998}}. The resulting algorithm makes the same comparisons but produces ascending order instead.</ref> ...

...k Training via Linear Programing]'', Advances in Optimization and Parallel Computing, 1992, p. 56</ref> The decision problem associated linear program for the M ...

...ref> Multiple comparisons to a control are also referred to as many-to-one comparisons. ...f name="Dunnett C. W. 1964">Dunnett C. W. (1964.) "New tables for multiple comparisons with a control", ''Biometrics'', '''20''':482{{Ndash}}491.</ref> ...

The actual matching operation performs at most 2''n'' − ''m'' comparisons.<ref name=igm-mlv>{{cite web |title=Two Way algorithm |url=http://www-igm.u ...sed needle:<ref>{{cite journal |last1=Breslauer |first1=Dany |title=Saving comparisons in the Crochemore-Perrin string-matching algorithm |journal=Theoretical Com ...

...how many errors could possibly be introduced given a reasonable amount of computing power on the part of the adversary. Once the channel has been given this re ...rsary wishes to force the Quicksort algorithm to make O(''n''²) comparisons. Then he would have to search all of the ''n''! permutations of the input s ...

...al function]]s of <math>X</math>. To simulate the algorithm, each of these comparisons or tests needs to be simulated, even though the <math>X</math> of the simul ...chnique use a [[parallel algorithm]] as the test algorithm, and group the comparisons that must be simulated into batches, in order to significantly reduce the n ...

...sorting]] more generally, algorithms for this problem can be based only on comparisons of these sums, or on other operations that work only when the inputs are sm ...are historically tied together, in that the first algorithms that used few comparisons were based on the weakness of the cell-counting lower bounds. ...

...that, if one is [[comparison sort]]ing a set of items then, no matter what comparisons may have already been performed, it is always possible to choose the next c ...ting problem can be completed in at most log_3/2''E'' additional comparisons.<ref name="Kahn 1984"/> ...

...oblems, so computing the upper envelope of a set of lines is equivalent to computing the convex hull of a set of moving points. ...nly dependent on the ordering of points, and the results of the line-point comparisons. Thus, the result can be certified with the following certificates: ...

...[comparison sort]] of <math>n</math> items must make <math>n\log(n)</math> comparisons. For comparison sorts, a query is a comparison of two items <math>a,b</math ...ormation about an input sequence <math>x_1,x_2,\ldots,x_n</math> via local comparisons: testing whether <math>x_i < x_j</math>, <math>x_i = x_j</math>, or <math>x ...

The results of these comparisons are concatenated and the value of the transform is an 8-bit value, that can * {{cite conference|title=Non-parametric local transforms for computing visual correspondence|book-title=European conference on computer vision|yea ...

{{Short description|Statistical model for pairwise comparisons}} ...is a [[probability theory|probability model]] for the outcome of pairwise comparisons between items, teams, or objects. Given a pair of items {{mvar|i}} and {{mv ...

...logic programming |url=https://doi.org/10.1145/502807.502810 |journal=ACM Computing Surveys |volume=33 |issue=3 |pages=374–425 |doi=10.1145/502807.502810 |issn ...

...</ref> by systematically choosing input values from within an allowed set, computing the value of the function, and recording the best value found during the pr | General purpose numerical and scientific computing library for Python. ...

...r of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for each key K the beginning of a subarr ...rray, so ProxmapSearch, in this worst case, will require <math>O(n)</math> comparisons. ...

...o a random-access paradigm not only mirrors the advancements in real-world computing systems but also underscores the growing relevance of RATMs in addressing t ...Notably, this characteristic of RATMs echoes the operation of contemporary computing systems featuring [[random-access memory]] (RAM). The formal model of RATMs ...

...e last two decades considerable attention has been drawn to the methods of computing [[price index]]es. The [[Boskin Commission]] in 1996 asserted that there we ...000007 Wyckoff, Andrew W., ”The Impact of Computer Prices on International Comparisons of Labour Productivity”], Economics of Innovation and New Technology, 1995, ...

...ws the implementation of a [[Medcouple#Fast algorithm|fast algorithm]] for computing the medcouple. == Algorithms for computing the medcouple == ...