13784 search results - page 433 / 2757 » On Computing Functions with Uncertainty |
134
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
203
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
176
click to vote
FSE
2004
Springer
16 years 5 days ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
168
click to vote
IFIP13
2004
15 years 8 months ago
2004
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
158
click to vote
COLT
2005
Springer
16 years 10 days ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...