Search results
Jump to navigation
Jump to search
- ...h functions <math>h_1,h_2,\ldots,h_k</math> map <math>[N]</math> to <math>[cn]</math>. ...> are independent uniform random functions from <math>[N]</math> to <math>[cn]</math>. ...3 KB (519 words) - 01:30, 24 July 2011
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...3 KB (595 words) - 02:43, 19 July 2011
- |data3 = liu [at] nju [dot] edu [dot] cn |data14= {xyfu, yixiaoyu} [at] smail [dot] nju [dot] edu [dot] cn ...6 KB (652 words) - 07:10, 27 April 2024
- |data3 = liu [at] nju [dot] edu [dot] cn |data14= {chenxiaoyu233, xyfu} [at] smail [dot] nju [dot] edu [dot] cn ...8 KB (752 words) - 08:34, 6 March 2024
- ...t <math>V=V_1\cup V_2\cup\cdots\cup V_n</math> be a partition of the <math>cn</math> vertices into <math>n</math> pairwise disjoint subsets, each of card ...3 KB (592 words) - 14:37, 19 April 2010
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...11 KB (2,062 words) - 05:21, 29 September 2021
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...11 KB (2,062 words) - 04:38, 24 September 2019
- cn\ln n-\left(\frac{c}{2}-1\right)n-1+\frac{c}{2n} 设<math>c=2</math>时，有<math>t(n)\le cn\ln n-\left(\frac{c}{2}-1\right)n-1+\frac{c}{2n}\le 2 n \ln n</math>对于所有<mat ...12 KB (1,125 words) - 08:41, 8 April 2024
- cn\ln n-\left(\frac{c}{2}-1\right)n-1+\frac{c}{2n} 设<math>c=2</math>时，有<math>t(n)\le cn\ln n-\left(\frac{c}{2}-1\right)n-1+\frac{c}{2n}\le 2 n \ln n</math>对于所有<mat ...12 KB (1,125 words) - 03:26, 13 April 2023
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...21 KB (3,854 words) - 09:32, 16 September 2020
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...21 KB (3,854 words) - 05:30, 20 September 2017
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...21 KB (3,854 words) - 02:21, 19 September 2018
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...21 KB (3,854 words) - 09:28, 16 September 2020
- ...y to <math>n</math> bins until no bin is empty. Then <math>\Pr[X\ge n\ln n+cn]<e^{-c}</math> for any <math>c>0</math>. ...e probability that bin <math>i</math> is empty after throwing <math>n\ln n+cn</math> balls is ...21 KB (3,868 words) - 05:58, 26 November 2016
- ...unctions <math>h_1,h_2,\ldots,h_k</math> map <math>\Omega</math> to <math>[cn]</math>, where both <math>c</math> and <math>k</math> are parameters that w ...ach <math>h_i</math> is a uniform random hash function <math>h_i:\Omega\to[cn]</math>. ...25 KB (4,512 words) - 07:51, 29 September 2020
- ...unctions <math>h_1,h_2,\ldots,h_k</math> map <math>\Omega</math> to <math>[cn]</math>, where both <math>c</math> and <math>k</math> are parameters that w ...ach <math>h_i</math> is a uniform random hash function <math>h_i:\Omega\to[cn]</math>. ...25 KB (4,512 words) - 06:13, 9 September 2021
- ...unctions <math>h_1,h_2,\ldots,h_k</math> map <math>\Omega</math> to <math>[cn]</math>, where both <math>c</math> and <math>k</math> are parameters that w ...ach <math>h_i</math> is a uniform random hash function <math>h_i:\Omega\to[cn]</math>. ...25 KB (4,512 words) - 15:48, 3 October 2022
- ...unctions <math>h_1,h_2,\ldots,h_k</math> map <math>\Omega</math> to <math>[cn]</math>, where both <math>c</math> and <math>k</math> are parameters that w ...ach <math>h_i</math> is a uniform random hash function <math>h_i:\Omega\to[cn]</math>. ...25 KB (4,512 words) - 09:09, 20 September 2018
- ...unctions <math>h_1,h_2,\ldots,h_k</math> map <math>\Omega</math> to <math>[cn]</math>, where both <math>c</math> and <math>k</math> are parameters that w ...ach <math>h_i</math> is a uniform random hash function <math>h_i:\Omega\to[cn]</math>. ...25 KB (4,512 words) - 05:52, 16 September 2019
- \Pr[T\ge n\ln n+cn]\le \mathrm{e}^{-c}. Thus for any <math>x,y\in\{0,1\}^n</math>, if <math>t\ge n\ln n+cn</math>, then <math>\Pr[X_t\neq Y_t\mid X_0=x,Y_0=y]\le \mathrm{e}^{-c}</mat ...13 KB (2,540 words) - 13:57, 10 August 2011