Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
—Identifying unusual or unique characteristics of an observed sample in useful in forensics in general and handwriting analysis in particular. Rarity is formulated as the probabi...
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...