Search results
Jump to navigation
Jump to search
- ...y when dividing two numbers in [[integer]] or fixed-point arithmetic; when computing mathematical functions such as [[square root]]s, [[logarithm]]s, and [[sine ...0.01 = 217.84, then rounding ''y'' to the integer ''q'' = 218, and finally computing ''z'' = ''q''×''m'' = 218×0.01 = 2.18. ...46 KB (7,060 words) - 01:36, 21 August 2017
- ...]</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 ...30 KB (5,405 words) - 09:12, 17 September 2015
- He also invented an original method for computing the probable size of a polymer in good solution. He invented the [[Flory-Hu ...9 KB (1,269 words) - 01:38, 22 March 2015
- The problem raises from parallel computing. Consider that we have <math>N</math> processors, connected by a communicat ...12 KB (2,110 words) - 02:55, 19 July 2011
- 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 The problem raises from parallel computing. Consider that we have <math>N</math> processors, connected by a communicat ...31 KB (5,481 words) - 03:52, 9 November 2010
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...15 KB (2,781 words) - 06:17, 29 September 2021
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...15 KB (2,781 words) - 16:38, 26 September 2023
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...15 KB (2,781 words) - 15:47, 3 October 2022
- ...ath>G(n,p)</math> is connected, then we can compare the probabilities, but computing the probability that a random graph is connected is a very non-trivial task ...show that with coupling, we can compare two distributions without actually computing the probabilities. ...37 KB (6,516 words) - 08:40, 7 June 2010
- ...can be verified in poly-time. However, there is no efficient algorithm for computing the <math>\phi(G)</math> unless '''NP'''='''P'''. ...15 KB (2,745 words) - 10:19, 4 January 2011
- The [[Automated Readability Index]] was designed for [[real-time computing]] of readability for the electric [[typewriter]].<ref>{{cite journal ...11 KB (1,581 words) - 08:33, 13 September 2015
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...16 KB (2,812 words) - 06:21, 21 November 2011
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...21 KB (3,854 words) - 02:21, 19 September 2018
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...21 KB (3,854 words) - 09:28, 16 September 2020
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...21 KB (3,854 words) - 09:32, 16 September 2020
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...21 KB (3,854 words) - 05:30, 20 September 2017
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...21 KB (3,868 words) - 05:58, 26 November 2016
- Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su ...19 KB (3,458 words) - 07:33, 12 March 2014
- Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su ...19 KB (3,458 words) - 06:18, 20 March 2013
- Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su ...19 KB (3,458 words) - 06:51, 12 October 2015
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...21 KB (3,837 words) - 09:44, 1 April 2013
- ...Professor Yitong Yin. His research mainly focuses on theory of distributed computing and randomized algorithms. Currently, he is working on distributed sampling ...12 KB (1,731 words) - 06:09, 29 April 2019
- : Efficient Algorithms and Data Structures for Geometric Computing ...21 KB (2,460 words) - 17:28, 7 March 2023
- Besides directly computing the probability <math>\Pr[X\ge t]</math>, we want to have some general way ...22 KB (3,809 words) - 05:34, 19 March 2014
- ...menon: An algorithmic perspective. ''Proc. 32nd ACM Symposium on Theory of Computing'' (STOC), 2000. ...23 KB (4,153 words) - 08:30, 12 October 2010
- ...menon: An algorithmic perspective. ''Proc. 32nd ACM Symposium on Theory of Computing'' (STOC), 2000. ...23 KB (4,153 words) - 08:18, 16 August 2011
- Besides directly computing the probability <math>\Pr[X\ge t]</math>, we want to have some general way ...24 KB (4,172 words) - 15:38, 19 March 2013
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...25 KB (4,555 words) - 08:25, 31 March 2014
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...30 KB (5,292 words) - 07:49, 3 August 2011
- ...er exponentially many subsets. We will see that it can be lower bounded by computing the maximum congestion caused by a set of paths. ...27 KB (4,860 words) - 03:17, 22 March 2011
- Besides directly computing the probability <math>\Pr[X\ge t]</math>, we want to have some general way ...29 KB (5,238 words) - 05:34, 13 November 2015
- Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su ...29 KB (5,077 words) - 04:54, 7 October 2010
- ...er exponentially many subsets. We will see that it can be lower bounded by computing the maximum congestion caused by a set of paths. ...28 KB (4,914 words) - 08:26, 7 June 2010
- # Let <math>F_C = F_A \land 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> ...22 KB (3,823 words) - 14:12, 15 November 2023
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...37 KB (6,690 words) - 02:23, 19 September 2018
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...37 KB (6,690 words) - 05:31, 20 September 2017
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...40 KB (7,253 words) - 10:53, 10 October 2023
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...40 KB (7,253 words) - 12:53, 11 October 2022
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...40 KB (7,253 words) - 06:10, 8 October 2019
- Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: ...40 KB (7,253 words) - 03:36, 19 October 2021
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...37 KB (6,763 words) - 09:43, 24 May 2013
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...31 KB (5,704 words) - 05:36, 13 November 2015
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...31 KB (5,704 words) - 08:39, 5 May 2014
- ...can be verified in poly-time. However, there is no efficient algorithm for computing the <math>\phi(G)</math> unless '''NP'''='''P'''. ...35 KB (6,195 words) - 08:39, 7 June 2010
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...39 KB (7,173 words) - 03:22, 4 November 2010
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...37 KB (6,743 words) - 09:07, 13 November 2011
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...38 KB (6,912 words) - 15:45, 3 October 2022
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...39 KB (7,106 words) - 09:54, 24 May 2013
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...42 KB (7,662 words) - 08:41, 7 June 2010
- The proposition can be formally verified by computing these expectations. Although these equations look formal, the intuitive int ...50 KB (9,096 words) - 06:09, 8 December 2015
- ...bit numbers is done <math>\bmod 2^u</math>, and have a one-line C-code for computing the hash function: ...48 KB (8,716 words) - 08:15, 15 October 2023