User contributions for 114.212.208.2

Results for 114.212.208.2 talk block log logs

Jump to navigation Jump to search

15:2415:24, 22 July 2011 diff hist 0 随机算法 (Fall 2011)/Probability Space No edit summary
15:2315:23, 22 July 2011 diff hist +30 随机算法 (Fall 2011)/Probability Space →Axioms of Probability
15:1815:18, 22 July 2011 diff hist +91 随机算法 (Fall 2011)/Probability Space →Axioms of Probability

03:4203:42, 21 July 2011 diff hist +1,424 N 随机算法 (Fall 2011)/Course materials Created page with '= Course textbook = {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" |…'

16:1916:19, 19 July 2011 diff hist −108 随机算法 (Fall 2011) No edit summary
16:1916:19, 19 July 2011 diff hist −2 随机算法 (Fall 2011) No edit summary
16:1816:18, 19 July 2011 diff hist −1,703 随机算法 (Fall 2011) No edit summary
16:1516:15, 19 July 2011 diff hist +6,812 随机算法 (Fall 2011) No edit summary
16:0816:08, 19 July 2011 diff hist 0 随机算法 (Fall 2011) →Lecture Notes
16:0416:04, 19 July 2011 diff hist +68 随机算法 (Fall 2011) →Lecture Notes
16:0316:03, 19 July 2011 diff hist +93 随机算法 (Fall 2011) →Lecture Notes
15:5515:55, 19 July 2011 diff hist +3,636 N 随机算法 (Fall 2011)/The Spectral Gap Created page with 'It turns out that the second largest eigenvalue of a graph contains important information about the graph's expansion parameter. The following theorem is the so-called Cheeger's …'
15:5415:54, 19 July 2011 diff hist −3,659 随机算法 (Fall 2011)/Graph Spectrum →The spectral gap current
15:5415:54, 19 July 2011 diff hist +66 随机算法 (Fall 2011) →Lecture Notes
15:5315:53, 19 July 2011 diff hist +1,476 N 随机算法 (Fall 2011)/Expander Mixing Lemma Created page with 'Given a <math>d</math>-regular graph <math>G</math> on <math>n</math> vertices with the spectrum <math>d=\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_n</math>, we denote <math>\lambd…'
15:5215:52, 19 July 2011 diff hist −1,508 随机算法 (Fall 2011)/Graph Spectrum →The expander mixing lemma
15:4915:49, 19 July 2011 diff hist +90 随机算法 (Fall 2011) →Lecture Notes
15:4715:47, 19 July 2011 diff hist 0 随机算法 (Fall 2011) →Lecture Notes
15:4515:45, 19 July 2011 diff hist −86 随机算法 (Fall 2011) →Lecture Notes
15:4415:44, 19 July 2011 diff hist +543 随机算法 (Fall 2011) →Lecture Notes
15:2015:20, 19 July 2011 diff hist +165 随机算法 (Fall 2011) →Lecture Notes
15:0615:06, 19 July 2011 diff hist +2,735 N 随机算法 (Fall 2011)/Graph Connectivity Created page with 'USTCON stands for '''undirected <math>s</math>-<math>t</math> connectivity'''. It is the problem which asks whether there is a path from vertex <math>s</math> to vertex <math>t</…'
15:0615:06, 19 July 2011 diff hist −2,748 随机算法 (Fall 2011)/Random Walks on Undirected Graphs →USTCON current
15:0615:06, 19 July 2011 diff hist +2,709 N 随机算法 (Fall 2011)/Cover Time Created page with 'For any <math>u,v\in V</math>, the '''hitting time''' <math>\tau_{u,v}</math> is the expected number of steps before vertex <math>v</math> is visited, starting from vertex <math>…' current
15:0515:05, 19 July 2011 diff hist −2,737 随机算法 (Fall 2011)/Random Walks on Undirected Graphs →Hitting and covering
15:0215:02, 19 July 2011 diff hist +582 随机算法 (Fall 2011) →Lecture Notes
14:3314:33, 19 July 2011 diff hist +118 随机算法 (Fall 2011) →Lecture Notes
08:0608:06, 19 July 2011 diff hist −16 随机算法 (Fall 2011) →Lecture Notes
05:3905:39, 19 July 2011 diff hist +160 随机算法 (Fall 2011) →Lecture Notes
02:3102:31, 19 July 2011 diff hist +7,210 N 随机算法 (Fall 2011)/Randomized Min-Cut Created page with 'Let <math>G(V, E)</math> be a graph. Suppose that we want to partition the vertex set <math>V</math> into two parts <math>S</math> and <math>T</math> such that the number of ''cr…'
02:2902:29, 19 July 2011 diff hist −4 随机算法 (Fall 2011)/Randomized Quicksort No edit summary
02:2902:29, 19 July 2011 diff hist −4 随机算法 (Fall 2011)/Randomized Quicksort No edit summary
02:2802:28, 19 July 2011 diff hist +7,274 N 随机算法 (Fall 2011)/Randomized Quicksort Created page with 'The following is the pseudocode of the famous [http://en.wikipedia.org/wiki/Quicksort Quicksort] algorithm, whose input is a set <math>S</math> of numbers. * if <math>|S|>1</math…'

Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Special:Contributions/114.212.208.2"