In this talk we will give an introduction to random projections. Define the linear separability of data by a margin $\gamma$.

Abstract: Let A be an $n \times n$ boolean matrix, i.e., its entries come from the set $\{0,1\}$. Let $r_i$ denote the number of 1's in the row $i$.

In information theory rate distortion addresses the problem of determining the minimal number of bits per symbol, as measured by the rate $R$, that should be communicated over a channel, so that the source (input signal) can be approximately recon

The method of variation of parameters, credited to J.L. Lagrange, expresses each solution of the perturbed system of differential equations, $x' = A(t)x + f(t)$, in terms of the solution of the associated homogeneous system, $y' = A(t)y$.

In this talk, we shall discuss various notions of convergence of dense graphs, and attempt to come up with a metric space where the notion of "left convergence" of graphs can be identified with Cauchy convergence.