14054 search results - page 2636 / 2811 » P |
182
click to vote
ICALP
1993
Springer
15 years 9 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
191
click to vote
ASPLOS
1992
ACM
15 years 9 months ago
1992
ACM
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...
138
click to vote
FOCS
1992
IEEE
15 years 9 months ago
1992
IEEE
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
135
click to vote
FOCS
1992
IEEE
15 years 9 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
161
click to vote
SIGGRAPH
1993
ACM
15 years 9 months ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...