1898 search results - page 12 / 380 » Weak Keys for IDEA |
IANDC
2010
13 years 7 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
WETICE
2006
IEEE
14 years 2 months ago
2006
IEEE
Although the strongest social relationships feature most prominently in our lives, we also maintain a multitude of much weaker connections: the distant colleagues that we share a ...
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
EUROCRYPT
2006
Springer
14 years 8 days ago
2006
Springer
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived fr...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Multiple Instance Learning (MIL) provides a framework for training a discriminative classifier from data with ambiguous labels. This framework is well suited for the task of learni...