1060 search results - page 111 / 212 » On the Discovery of Random Trees |
247
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
159
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
177
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper, we present a multiple targets classification system for visual concepts detection and image annotation. Multiple targets classification (MTC) is a variant ...
152
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
168
click to vote
EUROCRYPT
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we analyze the statistical distribution of the keystream generator used by the stream ciphers RC4 and RC4A. Our first result is the discovery of statistical biases o...