Sciweavers

6251 search results - page 311 / 1251
» Randomness, Computability, and Density
Sort
View
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 9 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
MOBIHOC
2007
ACM
16 years 6 months ago
Capacity of multi-channel wireless networks with random (c, f) assignment
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
Vartika Bhandari, Nitin H. Vaidya
ICALP
2004
Springer
16 years 1 days ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
CRYPTO
2008
Springer
120views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
Jean-Sébastien Coron, Jacques Patarin, Yann...
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 8 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer