494 search results - page 68 / 99 » Heap Building Bounds |
FSTTCS
2003
Springer
15 years 4 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
ICPP
2002
IEEE
15 years 3 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
INFOCOM
2002
IEEE
15 years 3 months ago
2002
IEEE
-- High performance packet switches frequently use a centralized scheduler (also known as an arbiter) to determine the configuration of a non-blocking crossbar. The scheduler often...
IWVF
2001
Springer
15 years 3 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
ICMCS
1999
IEEE
15 years 3 months ago
1999
IEEE
In this paper, we propose a buffer cache algorithm to build a cost effective storage server for real time news objects. In a News On Demand Server, the number of concurrent stream...