103 search results - page 7 / 21 » The Arithmetical Complexity of Dimension and Randomness |
JC
2006
13 years 8 months ago
2006
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
EMO
2005
Springer
14 years 2 months ago
2005
Springer
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
CORR
2010
Springer
13 years 8 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...