The need to regularize tensor fields arise recently in various applications. We treat in this paper tensors that belong to matrix Lie groups. We formulate the problem of these SO(...
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
We investigate how to effectively incorporate spatial structure information into histogram features for boosting visual classification performance motivated by recently proposed M...