1139 search results - page 82 / 228 » Bounded Ideation Theory |
DM
2000
13 years 9 months ago
2000
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
JCS
2000
13 years 9 months ago
2000
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
MLQ
1998
13 years 8 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ALT
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...