Abstract: Let f: F_2^n -> {+1, -1} be a Boolean function with the first Fourier norm A and Fourier sparsity s. We will prove that there is an affine subspace of the vector space F_2^n, of dimension O(A), on which the f is constant.

Abstract: In this talk we study the problem of partitioning a plane set into minimum number of parts with smaller diameters.

Abstract: Multidimensional scaling (MDS) is used to visualize pairwise similarity between objects.

Abstract: Necessary and sufficient conditions on a function $f(p)$ are given for the existence of a simulation procedure to simulate a Bernoulli random variable with success probability $f(p)$ from

Abstract: Most of the achievability proofs in Information theory are based on the concept of typicality. However, this typicality technique does not seem to be good enough to give achievability bounds in the most general settings, i.e.