29 search results - page 6 / 6 » Recovering randomness from an asymptotic Hamming distance |
APPROX
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
JMLR
2012
13 years 15 days ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
105
click to vote
CORR
2010
Springer
14 years 5 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
80
Voted
BMCBI
2007
14 years 10 months ago
2007
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...