11348 search results - page 2225 / 2270 » On time-scale designs for networks |
157
click to vote
PPOPP
1997
ACM
15 years 10 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
160
click to vote
SI3D
1997
ACM
15 years 10 months ago
1997
ACM
A pair of rendered images and their Z-buffers contain almost all of the information necessary to re-render from nearby viewpoints. For the small changes in viewpoint that occur in...
129
click to vote
SIGCOMM
1997
ACM
15 years 10 months ago
1997
ACM
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
183
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
168
click to vote
SPAA
1997
ACM
15 years 10 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...