41 search results - page 2 / 9 » Pseudorandom numbers and entropy conditions |
IGPL
2006
13 years 5 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
CSB
2004
IEEE
13 years 9 months ago
2004
IEEE
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
COMPSEC
2004
13 years 5 months ago
2004
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
IJCAI
1989
13 years 7 months ago
1989
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Information estimates such as the "direct method" of Strong et al. (1998) sidestep the difficult problem of estimating the joint distribution of response and stimulus by...