438 search results - page 77 / 88 » On Perfect Switching Classes |
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
APPROX
2006
Springer
14 years 16 days ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
SIGGRAPH
1995
ACM
14 years 10 days ago
1995
ACM
The use of prediction to eliminate or reduce the effects of system delays in Head-Mounted Display systems has been the subject of several recent papers. A variety of methods have ...
FAST
2008
13 years 11 months ago
2008
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...