406 search results - page 63 / 82 » Pseudorandomness and Combinatorial Constructions |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
ISCC
2000
IEEE
14 years 2 months ago
2000
IEEE
Mirror sites approach has been proposed recently for reducing the access delay and providing load balancing in network servers. In the mirror site approach a file, such as a multi...
SWAT
1992
Springer
14 years 1 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
AIPS
2007
14 years 5 days ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...