5115 search results - page 198 / 1023 » On Randomized Lanczos Algorithms |
210
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
143
click to vote
ICDAR
2007
IEEE
16 years 1 months ago
2007
IEEE
In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Subspaces. Th...
179
click to vote
ISSTA
2006
ACM
16 years 27 days ago
2006
ACM
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...
179
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
197
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...