Chernoff bound - PDFSEARCH.IO - Document Search Engine

Chernoff bound
Results: 63

#	Item
1	Reconstructive Dispersers and Hitting Set Generators Christopher Umans? Computer Science Department California Institute of Technology Pasadena CA 91125 Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2005-06-21 20:46:12 Disperser Extractor Chernoff bound Exponentiation
2	Spectral Graph Theory Lecture 17 Sparsification by Effective Resistance Sampling Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-11-03 13:58:23 Linear algebra Chernoff bound Matrix Trace Exponentiation Random matrix
3	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Faster Algorithms for Testing under Conditional Sampling Moein Falahatgar Ashkan Jafarpour Alon Orlitsky Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Probability distributions NC Chernoff bound Binomial distribution Outlier Normal distribution Beta distribution
4	Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:23 Analysis of algorithms Balls into bins With high probability Randomized algorithm Time complexity Chernoff bound Maximal independent set EdmondsPruhs protocol
5	Efficient Sampling Methods for Discrete Distributions Karl Bringmann and Konstantinos Panagiotou Max Planck Institute for Informatics Campus E1.4, 66123 Saarbr¨ ucken, Germany Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:38 Chernoff bound Primality tests Central limit theorem Exponential mechanism
6	Supplementary Material A Proof of Theorem 2.1 We will need to Hoeffding-Chernoff bound for negative dependence: Add to Reading List Source URL: jmlr.org Language: English - Date: 2016-05-01 21:17:10
7	Algorithmic Construction of Low-Discrepancy Point Sets via Dependent Randomized Rounding Benjamin Doerra , Michael Gnewuchb , Magnus Wahlstr¨oma a Max-Planck-Institut f¨ Add to Reading List Source URL: www.numerik.uni-kiel.de Language: English - Date: 2010-04-08 11:28:07 Mathematics Mathematical analysis Probability Quasirandomness Algorithms Randomized rounding Low-discrepancy sequence Chernoff bound Rounding Exponentiation Method of conditional probabilities
8	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
9	Parsimonious Flooding in Dynamic Graphs∗ Hervé Baumann Pierluigi Crescenzi Pierre Fraigniaud Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Mathematics Reachability Chernoff bound Random walk Random graph Statistics Graph connectivity Graph theory
10	Concentration Inequalities for Nonlinear Matroid Intersection∗ Konstantin Makarychev Microsoft Research Warren Schudy IBM Research Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:28 Matroid Randomized rounding Markov chain Linear programming Chernoff bound Tutte polynomial Sturm–Liouville theory Mathematics Matroid theory Dimension