Chernoff - PDFSEARCH.IO - Document Search Engine

Chernoff
Results: 111

#	Item
21	Editor-in-Chief Yury O. Chernoff Department of Biology Georgia Institute of Technology Atlanta, GA, USA Add to Reading List Source URL: www.med.upenn.edu Language: English - Date: 2011-11-08 17:04:16
22	CMEF 2009 PANEL I REPORT WHAT DID I NEED THEN? WHAT DO I NEED NOW? Chair: Egan J Chernoff Panelists: Add to Reading List Source URL: cms.math.ca - Date: 2010-03-08 15:06:26
23	Computing Chernoff ’s distribution Piet Groeneboom1 and Jon A. Wellner2 November 3, 1999 Abstract A distribution which arises in problems of estimation of monotone functions is that of the Add to Reading List Source URL: dutiosb.twi.tudelft.nl Language: English - Date: 2001-04-06 04:00:28 Statistical theory M-estimators Probability and statistics Normal distribution Maximum likelihood Heat equation Beta function Mean difference Statistics Mathematical analysis Estimation theory
24	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
25	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
26	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
27	Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems arXiv:1012.4889v1 [cs.DS] 22 DecHossein Jowhari1 , Mert Sa˘glam1 , and G´abor Tardos1,2 Add to Reading List Source URL: arxiv.org Language: English - Date: 2010-12-22 20:04:48 Analysis of algorithms Probabilistic complexity theory Quantum complexity theory Randomized algorithm Chernoff bound PP Big O notation Theoretical computer science Computational complexity theory Applied mathematics
28	Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2014-12-17 20:04:41 Applied mathematics Hashing Randomized algorithm Method of conditional probabilities Universal hashing Chernoff bound Tabulation hashing Random walk Algorithm Search algorithms Mathematics Theoretical computer science
29	Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04 Add to Reading List Source URL: cs.yale.edu Language: English - Date: 2014-12-17 20:04:41 Applied mathematics Hashing Randomized algorithm Method of conditional probabilities Universal hashing Chernoff bound Tabulation hashing Random walk Algorithm Search algorithms Mathematics Theoretical computer science