14699 search results - page 2596 / 2940 » Complexity and Cognitive Computing |
183
click to vote
JOC
2010
15 years 1 months ago
2010
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
191
click to vote
MMAS
2010
Springer
15 years 1 months ago
2010
Springer
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
156
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of cap...
157
Voted
SIAMCOMP
2010
15 years 29 days ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
173
click to vote
TCOM
2010
15 years 29 days ago
2010
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...