36781 search results - page 78 / 7357 » Parameterizing by the Number of Numbers |
FPL
2007
Springer
14 years 4 months ago
2007
Springer
Simple algorithms can be analytically characterized, but such analysis is questionable or even impossible for more complicated algorithms, such as Model Predictive Control (MPC). ...
ICTAI
2005
IEEE
14 years 3 months ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
ACSAC
2003
IEEE
14 years 3 months ago
2003
IEEE
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
ASIACRYPT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...