Feature selection concepts and methods
The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.
Unconditional Weak derandomization of weak algorithms Explicit versions of Yao s lemma Ronen Shaltiel, University of Haifa :
LEARNIN HE UNIFORM UNDER DISTRIBUTION – Toward DNF – Ryan ODonnell Microsoft Research January, 2006.
Randomized Distributed Decision Pierre Fraigniaud, Amos Korman, Merav Parter and David Peleg Yes No Yes No DISC 2012.
The Round Complexity of Two-Party Random Selection Saurabh Sanghvi and Salil Vadhan Harvard University.
7 - Model Assessment and Selection
paper340.doc.doc.doc.doc
software
20040402-Advances in Quantitative Electroencephalogram - Analysis Methods (Nitish v. Thakor and Shanbao Tong)
Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space Chris Beck Princeton University Joint work with Paul Beame & Russell.
CS187 - Spring 2008 Lecture 19 Searching and Sorting Announcements - Program 5 now due Monday!! Sorting is chapter 10 in textbook.
