The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
Background: The goal of most microarray studies is either the identification of genes that are most differentially expressed or the creation of a good classification rule. The dis...
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...