A quantile summary is a data structure that approximates to ε-relative error the order statistics of a much larger underlying dataset. In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses O( 1 ε log 1 ε ) words of memory. This improves upon the previous best upper bound of O( 1 ε log 1 ε ) by Agarwal et. ...

We prove several results giving new and stronger connections between learning theory, circuit complexity and pseudorandomness. Let C be any typical class of Boolean circuits, and C[s(n)] denote n-variable C-circuits of size ≤ s(n). We show: Learning Speedups. If C[poly(n)] admits a randomized weak learning algorithm under the uniform distribution with membership queries that runs in time 2/n, t...

Supercritical CO 2 blown foams of poly(ε-caprolactone) (PCL) covalent networks are developed through a two-step strategy by taking advantage the thermo-reversible Diels–Alder cycloaddition between furan and maleimide.

Amphiphilic block copolymers have attracted a great deal of attention in drug delivery systems. In this work, a series of monomethoxy-poly (ethylene glycol)-poly (ε-caprolactone-co-D,L-lactide) (MPEG-PCLA) copolymers with variable composition of poly (ε-caprolactone) (PCL) and poly (D,L-lactide) (PDLLA) were prepared via ring-opening copolymerization of ε-CL and D,L-LA in the presence of MPEG a...

We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples. Our algorithms can tolerate malicious noise rates exponentially larger than previous work in terms of the dependence on the dimension n, and succeed for the fairly broad class of all isotropic log-concave distributio...