2434 search results - page 222 / 487 » Algorithmic Randomness of Closed Sets |
139
click to vote
SC
2003
ACM
15 years 9 months ago
2003
ACM
We develop and evaluate a system for load management in shared-disk file systems built on clusters of heterogeneous computers. The system generalizes load balancing and server pr...
144
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
141
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
149
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
119
click to vote
ISVC
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a new image-space algorithm for real-time collision detection, where the GPU computes the potentially colliding sets, and the CPU performs the standard triangle...