5115 search results - page 313 / 1023 » On Randomized Lanczos Algorithms |
156
click to vote
IPL
2000
15 years 7 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
178
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O...
174
click to vote
CSE
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
153
click to vote
TFS
2010
15 years 2 months ago
2010
This study suggests the use of fuzzy-filtering algorithms to deal with the uncertainties associated to the analysis of physiological signals. The signal characteristics, for a give...
212
click to vote
PODS
2003
ACM
16 years 7 months ago
2003
ACM
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...