5153 search results - page 206 / 1031 » Introduction to Randomized Algorithms |
123
click to vote
ISSTA
2006
ACM
15 years 9 months 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...
138
click to vote
PODS
2006
ACM
16 years 3 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...
134
Voted
CORR
2010
Springer
15 years 3 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...
155
click to vote
JGAA
2007
15 years 3 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
129
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...