Search results

Jump to navigation Jump to search
View ( | ) (20 | 50 | 100 | 250 | 500)
  • ...o see that the space cost of count-min sketch is <math>O(km)</math> memory words, or <math>O(km\log n)</math> bits. Each query is answered within time cost ...km)=O\left(\frac{1}{\epsilon}\log\frac{1}{\delta}\right)</math> (in memory words) and answering each query <math>x\in\Omega</math> in time <math>O(k)=O\left ...
    25 KB (4,512 words) - 15:48, 3 October 2022
  • ...o see that the space cost of count-min sketch is <math>O(km)</math> memory words, or <math>O(km\log n)</math> bits. Each query is answered within time cost ...km)=O\left(\frac{1}{\epsilon}\log\frac{1}{\delta}\right)</math> (in memory words) and answering each query <math>x\in\Omega</math> in time <math>O(k)=O\left ...
    25 KB (4,512 words) - 06:13, 9 September 2021
  • ...o see that the space cost of count-min sketch is <math>O(km)</math> memory words, or <math>O(km\log n)</math> bits. Each query is answered within time cost ...km)=O\left(\frac{1}{\epsilon}\log\frac{1}{\delta}\right)</math> (in memory words) and answering each query <math>x\in\Omega</math> in time <math>O(k)=O\left ...
    25 KB (4,512 words) - 05:52, 16 September 2019
  • ...ng forest in <math>Y</math>), it holds that <math>|S|=n-k</math>. In other words, for any <math>Y\subseteq E</math>, all maximal member of <math>\mathcal{F} ...r that <math>\{x_1,\ldots,x_{k-1},y_i\}\not\in\mathcal{F}</math>. In other words, <math>\{x_1,\ldots,x_{k-1}\}</math> is a basis of <math>Y=\{x_1,\ldots,x_{ ...
    24 KB (4,341 words) - 13:24, 11 December 2011
  • ...= http://jeff560.tripod.com/i.html | title = Earliest Uses of Some of the Words of Mathematics | contribution = Injection, Surjection and Bijection | publi ...
    11 KB (1,621 words) - 07:51, 17 July 2016
  • ...(in [[British English]]) or ''math'' (in [[American English]]). The short words ''maths'' or ''math'' are often used for [[arithmetic]], [[geometry]] or si ...
    9 KB (1,088 words) - 18:04, 22 August 2017
  • In other words, <math>Aw</math> is a random projection of a fixed unit vector; and <math>B ...
    14 KB (2,413 words) - 15:11, 12 May 2013
  • In other words, <math>Aw</math> is a random projection of a fixed unit vector; and <math>B ...
    14 KB (2,413 words) - 02:32, 25 November 2011
  • ...and "dashes", which are known to occur in the proportion of 3:4. In other words, the probability of a "dot" being sent is <math>3/7</math>, and the probabi ...
    13 KB (2,127 words) - 10:18, 20 March 2024
  • In other words, for any set family <math>\mathcal{F}</math> with <math>|\mathcal{F}|>\sum_ In other words, for a hereditary family <math>\mathcal{F}</math>, if <math>R\in\mathcal{F} ...
    50 KB (8,991 words) - 12:23, 21 May 2023
  • In other words, for any set family <math>\mathcal{F}</math> with <math>|\mathcal{F}|>\sum_ In other words, for a hereditary family <math>\mathcal{F}</math>, if <math>R\in\mathcal{F} ...
    50 KB (8,991 words) - 09:48, 20 May 2024
  • In other words, the <math>Contract(G,uv)</math> merges the two vertices <math>u</math> and ...
    15 KB (2,698 words) - 02:36, 12 March 2023
  • ...jeff560.tripod.com/mathword.html |title=Earliest known uses of some of the words of mathematics}}</ref> ...
    12 KB (1,881 words) - 09:42, 29 May 2017
  • ...s are all the old neighbors of <math>u</math> and <math>v</math>. In other words, <math>u</math> and <math>v</math> are merged into one vertex. The old edge ...
    16 KB (2,893 words) - 08:43, 7 June 2010
  • In other words, the encoding of trees to tuples by the Prüfer code is reversible, thus the ...
    17 KB (3,190 words) - 12:43, 18 April 2013
  • In other words, the encoding of trees to tuples by the Prüfer code is reversible, thus the ...
    17 KB (3,190 words) - 04:35, 17 October 2016
  • In other words, the encoding of trees to tuples by the Prüfer code is reversible, thus the ...
    17 KB (3,190 words) - 03:55, 27 October 2015
  • In other words, the encoding of trees to tuples by the Prüfer code is reversible, thus the ...
    17 KB (3,190 words) - 05:36, 23 October 2017
  • In other words, the encoding of trees to tuples by the Prüfer code is reversible, thus the ...
    17 KB (3,190 words) - 11:36, 13 April 2023
  • In other words, the encoding of trees to tuples by the Prüfer code is reversible, thus the ...
    17 KB (3,190 words) - 07:11, 14 October 2019
View ( | ) (20 | 50 | 100 | 250 | 500)