Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)

Page title matches

Page text matches

  • |[[File:Probability and Computing. 2nd Edition cover.jpg|border|143x143px]]|| :'''''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis ...
    2 KB (231 words) - 05:23, 28 August 2024
  • |[[File:Probability and Computing. 2nd Edition cover.jpg|border|143x143px]]|| :'''''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis ...
    2 KB (231 words) - 06:43, 14 September 2023
  • In [[computing]] science common monoids include [[addition]], [[multiplication]], or, and. ...
    729 bytes (116 words) - 19:01, 14 June 2016
  • ...]</math> by the definition of expectations. There is also a smarter way of computing <math>\mathbf{E}[X]</math>, by using indicators and the linearity of expec ...
    3 KB (445 words) - 02:33, 19 July 2011
  • * '''[MU]''' Michael Mitzenmacher and Eli Upfal. ''Probability and Computing: Randomized Algorithms and Probabilistic Analysis''. Cambridge University P ...
    2 KB (132 words) - 11:58, 11 January 2010
  • == Computing == In [[computing]], the colon [[character (computing)|character]] is represented by [[ASCII]] code 58, and is located at [[Unico ...
    5 KB (834 words) - 09:40, 24 August 2017
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    1 KB (152 words) - 13:53, 5 September 2022
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    1 KB (155 words) - 13:59, 5 September 2022
  • | title = A method for computing all maximally general rules in attribute-value systems | title = Induction of classification rules by granular computing ...
    5 KB (563 words) - 09:09, 4 February 2016
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    1 KB (159 words) - 01:48, 31 August 2016
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    1 KB (159 words) - 05:43, 3 September 2018
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    1 KB (159 words) - 08:13, 1 August 2017
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    1 KB (159 words) - 00:15, 2 September 2019
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    2 KB (164 words) - 15:02, 22 February 2013
  • ...,a_2,\ldots,a_r</math>. Generalize the principle of inclusion-exclusion by computing <math>N_m</math> as the following form ...
    2 KB (227 words) - 12:38, 3 November 2015
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    2 KB (177 words) - 04:10, 17 February 2014
  • * [https://arxiv.org/abs/1907.09415 Ronald de Wolf. Quantum Computing: Lecture Notes.] ...
    2 KB (222 words) - 06:09, 21 February 2022
  • ...y big). There exist methods of fast division by <math>x - a</math>, so the computing the remainder could be easier than the whole function. ...
    1 KB (269 words) - 18:04, 4 May 2016
  • :'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. ...
    3 KB (240 words) - 14:31, 21 July 2011
  • * [https://arxiv.org/abs/1907.09415 Ronald de Wolf. Quantum Computing: Lecture Notes. 19 Jul 2019] ...
    2 KB (234 words) - 07:58, 12 September 2019
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)