5115 search results - page 212 / 1023 » On Randomized Lanczos Algorithms |
204
click to vote
NIPS
2008
15 years 8 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
199
Voted
NIPS
2007
15 years 8 months ago
2007
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
160
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
186
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
158
Voted
SIAMJO
2008
15 years 6 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...