14704 search results - page 2813 / 2941 » computing 2007 |
120
Voted
CC
2007
Springer
15 years 3 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
121
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
136
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
127
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables ...