Randomized Algorithms (Spring 2010)/More on Chernoff bounds: Revision history

17 March 2010

• curprev 12:0512:05, 17 March 2010‎ imported>WikiSysop‎ 21,979 bytes −34‎ →‎Random projection of fixed unit vector \equiv fixed projection of random unit vector
• curprev 11:5711:57, 17 March 2010‎ imported>WikiSysop‎ 22,013 bytes +54‎ →‎Random projection of fixed unit vector \equiv fixed projection of random unit vector
• curprev 11:2311:23, 17 March 2010‎ imported>WikiSysop‎ 21,959 bytes +22‎ →‎Random projection of fixed unit vector \equiv fixed projection of random unit vector
• curprev 10:3010:30, 17 March 2010‎ imported>WikiSysop‎ 21,937 bytes +756‎ →‎Low-Distortion Embeddings
• curprev 10:1410:14, 17 March 2010‎ imported>WikiSysop‎ 21,181 bytes +1,244‎ →‎Random projection of fixed unit vector \equiv fixed projection of random unit vector
• curprev 09:2709:27, 17 March 2010‎ imported>WikiSysop‎ 19,937 bytes +111‎ →‎From distances to unit vectors
• curprev 09:2509:25, 17 March 2010‎ imported>WikiSysop‎ 19,826 bytes +52‎ →‎From distances to unit vectors
• curprev 09:2309:23, 17 March 2010‎ imported>WikiSysop‎ 19,774 bytes +5‎ →‎Represent the delay as the sum of independent trials
• curprev 09:2309:23, 17 March 2010‎ imported>WikiSysop‎ 19,769 bytes +2‎ →‎Represent the delay as the sum of independent trials
• curprev 09:2309:23, 17 March 2010‎ imported>WikiSysop‎ 19,767 bytes +2‎ →‎Reduce the delay of a route to the number of packets that pass through the route
• curprev 09:2209:22, 17 March 2010‎ imported>WikiSysop‎ 19,765 bytes +3‎ →‎From distances to unit vectors
• curprev 09:2109:21, 17 March 2010‎ imported>WikiSysop‎ 19,762 bytes +776‎ →‎From distances to single vectors
• curprev 08:5808:58, 17 March 2010‎ imported>WikiSysop‎ 18,986 bytes +13‎ →‎From distances to single vectors
• curprev 08:4308:43, 17 March 2010‎ imported>WikiSysop‎ 18,973 bytes +6‎ →‎From distances to single vectors
• curprev 08:4208:42, 17 March 2010‎ imported>WikiSysop‎ 18,967 bytes +775‎ →‎Low-Distortion Embeddings
• curprev 08:3108:31, 17 March 2010‎ imported>WikiSysop‎ 18,192 bytes +175‎ →‎From distances to single vectors
• curprev 08:2508:25, 17 March 2010‎ imported>WikiSysop‎ 18,017 bytes −16‎ →‎Proof of Johnson-Lindenstrauss Theorem
• curprev 08:2308:23, 17 March 2010‎ imported>WikiSysop‎ 18,033 bytes +124‎ →‎Johnson-Lindenstrauss Theorem
• curprev 08:1008:10, 17 March 2010‎ imported>WikiSysop‎ 17,909 bytes +1,494‎ →‎Johnson-Lindenstrauss Theorem
• curprev 07:3607:36, 17 March 2010‎ imported>WikiSysop‎ 16,415 bytes +575‎ →‎Johnson-Lindenstrauss Theorem
• curprev 06:5906:59, 17 March 2010‎ imported>WikiSysop‎ 15,840 bytes −4‎ →‎Set balancing

16 March 2010

• curprev 13:5413:54, 16 March 2010‎ imported>WikiSysop‎ 15,844 bytes +2‎ →‎Dealing with Phase II
• curprev 13:5413:54, 16 March 2010‎ imported>WikiSysop‎ 15,842 bytes +9‎ →‎Analysis
• curprev 13:5213:52, 16 March 2010‎ imported>WikiSysop‎ 15,833 bytes +947‎ →‎Apply the Chernoff bound
• curprev 13:3613:36, 16 March 2010‎ imported>WikiSysop‎ 14,886 bytes −4‎ →‎Analysis
• curprev 13:3213:32, 16 March 2010‎ imported>WikiSysop‎ 14,890 bytes −6‎ →‎Estimate the expectation of the sum
• curprev 13:2713:27, 16 March 2010‎ imported>WikiSysop‎ 14,896 bytes +235‎ →‎Analysis
• curprev 13:2213:22, 16 March 2010‎ imported>WikiSysop‎ 14,661 bytes +18‎ →‎A two-phase randomized routing algorithm
• curprev 13:2113:21, 16 March 2010‎ imported>WikiSysop‎ 14,643 bytes +2,281‎ →‎A two-phase randomized routing algorithm
• curprev 12:3912:39, 16 March 2010‎ imported>WikiSysop‎ 12,362 bytes +915‎ →‎A two-phase randomized routing algorithm
• curprev 12:1112:11, 16 March 2010‎ imported>WikiSysop‎ 11,447 bytes +114‎ →‎A two-phase randomized routing algorithm
• curprev 11:3511:35, 16 March 2010‎ imported>WikiSysop‎ 11,333 bytes +178‎ →‎Routing on a hypercube
• curprev 11:3211:32, 16 March 2010‎ imported>WikiSysop‎ 11,155 bytes +29‎ →‎Routing on a hypercube

10 March 2010

• curprev 12:1112:11, 10 March 2010‎ imported>WikiSysop‎ 11,126 bytes +5,549‎ No edit summary

25 February 2010

• curprev 14:5614:56, 25 February 2010‎ 172.21.5.128 talk‎ 5,577 bytes +136‎ →‎A two-phase randomized routing algorithm
• curprev 14:5014:50, 25 February 2010‎ 172.21.5.128 talk‎ 5,441 bytes +18‎ →‎A two-phase randomized routing algorithm
• curprev 14:4814:48, 25 February 2010‎ 172.21.5.128 talk‎ 5,423 bytes −10‎ →‎A two-phase randomized routing algorithm
• curprev 14:4714:47, 25 February 2010‎ 172.21.5.128 talk‎ 5,433 bytes +270‎ →‎A two-phase randomized routing algorithm
• curprev 14:4014:40, 25 February 2010‎ 172.21.5.128 talk‎ 5,163 bytes +50‎ →‎Routing on a hypercube
• curprev 14:3814:38, 25 February 2010‎ 172.21.5.128 talk‎ 5,113 bytes +367‎ →‎Routing on a hypercube
• curprev 14:3214:32, 25 February 2010‎ 172.21.5.128 talk‎ 4,746 bytes +1,062‎ →‎Permutation Routing

24 February 2010

• curprev 14:3914:39, 24 February 2010‎ 172.21.7.100 talk‎ 3,684 bytes +293‎ →‎Routing in a hypercube
• curprev 14:2314:23, 24 February 2010‎ 172.21.7.100 talk‎ 3,391 bytes +15‎ →‎Routing in a hypercube
• curprev 14:2114:21, 24 February 2010‎ 172.21.7.100 talk‎ 3,376 bytes +2‎ →‎Routing in a hypercube
• curprev 14:1914:19, 24 February 2010‎ 172.21.7.100 talk‎ 3,374 bytes +3‎ →‎Routing in a hypercube
• curprev 14:1814:18, 24 February 2010‎ 172.21.7.100 talk‎ 3,371 bytes +423‎ →‎Routing in a hypercube
• curprev 14:0914:09, 24 February 2010‎ 172.21.7.100 talk‎ 2,948 bytes +777‎ →‎Routing in a hypercube
• curprev 13:4913:49, 24 February 2010‎ 172.21.7.100 talk‎ 2,171 bytes +632‎ →‎Routing in a hypercube
• curprev 13:3913:39, 24 February 2010‎ 172.21.7.100 talk‎ 1,539 bytes +1,331‎ →‎Permutation Routing

22 February 2010

• curprev 13:1613:16, 22 February 2010‎ imported>WikiSysop‎ 208 bytes +208‎ Created page with '== Permutation Routing == Now we introduce a more "serious" application of Chernoff bounds: the two-phase randomized algorithm for the permutation routing in a hypercube. == Jo…'