1668 search results - page 14 / 334 » Two Philosophical Applications of Algorithmic Information Th... |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items...
CHES
1999
Springer
15 years 3 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
CORR
1998
Springer
14 years 11 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
NIPS
2008
15 years 1 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...