WAE
2001
13 years 11 months ago
2001
WAE
2001
13 years 11 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
WAE
2001
13 years 11 months ago
2001
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing u...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
SODA
2004
ACM
13 years 11 months ago
2004
ACM