5115 search results - page 389 / 1023 » On Randomized Lanczos Algorithms |
176
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Among the many ways to model signals, a recent approach that draws considerable attention is sparse representation modeling. In this model, the signal is assumed to be generated a...
189
click to vote
SCN
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We propose and analyse a new countermeasure against Differential Power Analysis (DPA) for the AES encryption algorithm, based on permutation tables. As opposed to existin...
310
click to vote
WAOA
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
195
Voted
APPROX
2009
Springer
16 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
189
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...