5 citations · 7 across the 4 of their papers we have counts for
4 papers
Sparse Linear Networks with a Fixed Butterfly Structure: Theory and Practice
Nir Ailon, Omer Leibovich, Vineet Nair
A butterfly network consists of logarithmically many layers, each with a linear number of non-zero weights (pre-specified). The fast Johnson-Lindenstrauss transform (FJLT) can be r…
Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests
Janaky Murthy, Vineet Nair, Chandan Saha
Equivalence testing for a polynomial family {g_m} over a field F is the following problem: Given black-box access to an n-variate polynomial f(x), where n is the number of variable…
BMF: Block matrix approach to factorization of large scale data
Prasad G Bhavana, Vineet C Nair
Matrix Factorization (MF) on large scale matrices is computationally as well as memory intensive task. Alternative convergence techniques are needed when the size of the input matr…
An explicit sparse recovery scheme in the L1-norm
Arnab Bhattacharyya, Vineet Nair
Consider the approximate sparse recovery problem: given Ax, where A is a known m-by-n dimensional matrix and x is an unknown (approximately) sparse n-dimensional vector, recover an…