5606 search results - page 148 / 1122 » Randomization Techniques for Graphs. |
LATIN
2004
Springer
14 years 4 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
SACRYPT
2004
Springer
14 years 4 months ago
2004
Springer
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
ISCA
2012
IEEE
12 years 1 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
DM
2007
13 years 10 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...