The widespread use of internet has raised serious concerns of privacy and trust. In order to address these concerns, cryptographic protocols are widely used.

Given a set $P$ of $n$ points in $R^d$, a weak $epsilon$-net of $P$ with respect to convex sets in a subset of $R^d$ that intersects every convex set containing an $epsilon$-fraction of the points in $P$.

We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope.

Epsilon nets and approximations are among the most fundamental notions of sampling.

Slepian and Wolf gave the rate-region for the distributed encoding of correlated and memoryless sources when the number of copies of source output is unlimited.