5115 search results - page 749 / 1023 » On Randomized Lanczos Algorithms |
209
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
207
click to vote
SIAMREV
2010
15 years 1 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
216
click to vote
ECCC
2011
14 years 10 months ago
2011
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
210
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
206
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...