203 search results - page 18 / 41 » An O(nlogn) time algorithm for optimal buffer insertion |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
ICMCS
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper, we develop a new service to support optimally ensured user interactions with minimum latency in interactive distributed multimedia presentation environments. The no...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...