440 search results - page 9 / 88 » On partial randomness |
ICPP
2005
IEEE
14 years 4 months ago
2005
IEEE
We propose a novel replication-based two-phase scheduling algorithm designed to achieve DAG scheduling with small makespans and high efficiency. In the first phase, the schedule...
JCO
2008
13 years 11 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
FSE
2008
Springer
14 years 13 days ago
2008
Springer
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
CPC
2006
13 years 11 months ago
2006
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...