Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Janakiraman, Nagaraj T."'
In this work, we leverage advances in sparse coding techniques to reduce the number of trainable parameters in a fully connected neural network. While most of the works in literature impose $\ell_1$ regularization, DropOut or DropConnect techniques t
Externí odkaz:
http://arxiv.org/abs/1907.02051
We consider the problem of querying a string (or, a database) of length $N$ bits to determine all the locations where a substring (query) of length $M$ appears either exactly or is within a Hamming distance of $K$ from the query. We assume that sketc
Externí odkaz:
http://arxiv.org/abs/1704.07852
We consider the problem of non-adaptive group testing of $N$ items out of which $K$ or less items are known to be defective. We propose a testing scheme based on left-and-right-regular sparse-graph codes and a simple iterative decoder. We show that f
Externí odkaz:
http://arxiv.org/abs/1701.07477