1511 search results - page 122 / 303 » Randomness, lowness and degrees |
143
click to vote
RSA
2010
15 years 4 months ago
2010
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
139
click to vote
BROADNETS
2007
IEEE
16 years 21 days ago
2007
IEEE
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
190
click to vote
HICSS
2007
IEEE
16 years 20 days ago
2007
IEEE
We introduce a stochastic model that describes the quasistatic dynamics of an electric transmission network under perturbations introduced by random load fluctuations, random rem...
199
click to vote
INDOCRYPT
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
150
click to vote
ICIAP
2005
ACM
16 years 6 months ago
2005
ACM
Automatic recognition of time and date stamps in CCTV video enables the inclusion of time-based queries in video indexing applications. Such ability needs to deal with problems of ...