Search results
Jump to navigation
Jump to search
Page title matches
(1,776 × 2,560 (401 KB)) - 07:28, 13 February 2023- 3 KB (526 words) - 04:59, 30 June 2016
Probability and Computing. 2nd Edition cover ...(840 × 1,198 (220 KB)) - 06:37, 14 September 2023
Page text matches
- Probability and Computing. 2nd Edition cover ...(840 × 1,198 (220 KB)) - 06:37, 14 September 2023
- |[[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
- ...1.43.3535 The accuracy of floating point summation]", ''SIAM J. Scientific Computing'' '''14''' (4), 783–799 (1993). ...2 KB (344 words) - 13:31, 21 July 2017
- *Let <math>F_C = F_A \and F_B</math> be the Bloom filter formed by computing the bitwise AND of <math>F_A</math> and <math>F_B</math>. Argue that <math> ...2 KB (406 words) - 14:53, 22 September 2018
- = Computing Graph Expansion = ...can be verified in poly-time. However, there is no efficient algorithm for computing the <math>\phi(G)</math> unless '''NP'''='''P'''. ...8 KB (1,407 words) - 02:23, 25 July 2011
- ...on algorithms for counting and sampling problems. Typical problems include computing marginal probabilities and expectations of random variables, the evaluation :何昆：Kun HE received his Ph.D. degree from the Institute of Computing Technology, Chinese Academy of Sciences in 2019. Currently he is a postdoct ...20 KB (1,328 words) - 14:52, 20 November 2020
- * [https://arxiv.org/abs/1907.09415 Ronald de Wolf. Quantum Computing: Lecture Notes.] ...4 KB (379 words) - 12:06, 27 September 2021
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...4 KB (690 words) - 07:14, 14 October 2019
- Besides directly computing the probability <math>\Pr[X\ge t]</math>, we want to have some general way ...3 KB (541 words) - 15:18, 21 July 2011
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...3 KB (542 words) - 11:27, 9 April 2014
- ...d store the results in memory. Afterwards he can decrypt the ciphertext by computing ''D<sub>K</sub>''(''C'') for each ''K''. Any matches between these two resu ...3 KB (474 words) - 09:45, 20 October 2014
- ...for deterministic communication protocols, this is the best we can get for computing EQ. :Any deterministic communication protocol computing EQ on two <math>n</math>-bit strings costs <math>n</math> bits of communica ...9 KB (1,662 words) - 07:05, 15 November 2011
- |data17 = '''Probability and Computing''' (2E) <br> Michael Mitzenmacher and Eli Upfal <br> Cambridge University * '''[MU]''' ''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis ...15 KB (1,488 words) - 11:17, 6 May 2024
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...3 KB (604 words) - 09:12, 23 November 2015
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...3 KB (604 words) - 05:32, 31 October 2016
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...3 KB (622 words) - 11:08, 22 December 2020
- ...mal language] (not entirely the same thing as the c language). The task of computing <math>f(x)</math> is equivalent to that of determining whether <math>x\in L ...nomial size certificate, the algorithm <math>A</math> verifies (instead of computing) the <math>f(x)</math> for any positive instance <math>x</math> in polynomi ...11 KB (1,828 words) - 06:00, 27 August 2011
- A naive way of checking the equality is first computing <math>AB</math> and then comparing the result with <math>C</math>. The (asy ...4 KB (694 words) - 03:25, 23 July 2011
- ;The Monte Carlo method for computing <math>\mathrm{e}</math> ...4 KB (606 words) - 01:47, 10 October 2011
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...3 KB (666 words) - 04:44, 23 July 2013
- * [[Computer language]] for application of formal languages in computing ...5 KB (710 words) - 00:57, 25 February 2017
- ...e need the following theorem, which holds generally and is very useful for computing the AND of many events. ...5 KB (881 words) - 02:35, 19 July 2011
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...4 KB (762 words) - 08:28, 19 November 2019
- ...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...4 KB (769 words) - 12:19, 12 November 2017
- ...ok.html|title = Proceedings of the Third Annual ACM Symposium on Theory of Computing|pages = 151–158}}</ref> ...ust 1% of the worst-case number of computation and that saves a ''lot'' of computing, but that is still <math>0.01 \times (2^n)</math> computations. And every e ...15 KB (2,427 words) - 22:24, 16 August 2017
- |data17 = '''Probability and Computing''' (2E) <br> Michael Mitzenmacher and Eli Upfal <br> Cambridge University * '''[MU]''' ''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis ...21 KB (2,167 words) - 07:44, 27 February 2024
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: We propose an extremely simple "randomized algorithm" for computing a <math>b\in\{-1,+1\}^m</math>: for each <math>i=1,2,\ldots, m</math>, let ...15 KB (2,761 words) - 06:11, 8 December 2015
- ...tudies of algorithms for elimination orderings in combinatorial scientific computing, our result is the first rigorous incorporation of randomized tools in this :Huacheng Yu (俞华程) is a postdoctoral researcher in the Theory of Computing group at Harvard University. He obtained his PhD from Stanford University i ...14 KB (1,850 words) - 01:51, 7 May 2018
- We propose an extremely simple "randomized algorithm" for computing a <math>b\in\{-1,+1\}^m</math>: for each <math>i=1,2,\ldots, m</math>, let ...5 KB (952 words) - 02:52, 19 July 2011
- ...> multiplications, which is too expensive. We describe an efficient way of computing the [http://en.wikipedia.org/wiki/Modular_exponentiation modular exponent] ...ed a number instead of a list of all colorings, we expect cleverer ways of computing this number than the brute force enumeration. ...29 KB (4,994 words) - 01:21, 29 August 2011
- ...he search for new Mersenne primes is the goal of the [[GIMPS]] distributed computing project. *[http://www.oddperfect.org OddPerfect.org] A projected distributed computing project to search for odd perfect numbers. ...12 KB (1,697 words) - 23:40, 1 August 2016
- |data13 = Mitzenmacher and Upfal. <br>''Probability and Computing: Randomized Algorithms and Probabilistic Analysis''. <br> Cambridge Univ Pr ...9 KB (893 words) - 12:43, 15 September 2017