1117 search results - page 55 / 224 » Equivalent Representations of Set Functions |
104
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
96
Voted
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
96
Voted
CRYPTO
1992
Springer
15 years 4 months ago
1992
Springer
We prove that the set of DES permutations (encryption and decryption for each DES key) is not closed under functional composition. This implies that, in general, multiple DES-encry...
107
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
97
Voted
IANDC
2010
14 years 11 months ago
2010
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...