Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CIE
2007
Springer

favoriteEmaildiscussreport

109views Applied Computing» more CIE 2007»

A Weakly 2-Random Set That Is Not Generalized Low

13 years 8 months ago

A Weakly 2-Random Set That Is Not Generalized Low

Download www.math.uchicago.edu

A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alternative holds. We add further evidence in this direction by showing that, in contrast to the case for 2-randomness, a weakly 2-random set can fail to be generalized low.

Andrew Lewis, Antonio Montalbán, Andr&eacut

Real-time Traffic

Alternative Holds | Applied Computing | CIE 2007 | Weak 2-randomness |

claim paper

Related Content

» On the Existence of Linear Weak Learners and Applications to Boosting

» NORM compact model order reduction of weakly nonlinear systems

» MultiLabel Learning with Weak Label

» KDD Feature Set Complaint Heuristic Rules for R2L Attack Detection

» Multiple Component Learning for Object Detection

» Opportunistic realtime routing in multihop wireless sensor networks

» HighPerformance Rotation Invariant Multiview Face Detection

» Screening synteny blocks in pairwise genome comparisons through integer programming

» On the Algebraic Immunity of Symmetric Boolean Functions

Post Info
More Details (n/a)

Added	13 Aug 2010
Updated	13 Aug 2010
Type	Conference
Year	2007
Where	CIE
Authors	Andrew Lewis, Antonio Montalbán, André Nies

Comments (0)