203 search results - page 38 / 41 » An O(nlogn) time algorithm for optimal buffer insertion |
SODA
1993
ACM
13 years 8 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
CASES
2003
ACM
13 years 12 months ago
2003
ACM
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
BIBM
2008
IEEE
14 years 1 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
MM
1997
ACM
13 years 11 months ago
1997
ACM
–Large scale clustered continuous media (CM) servers deployed in applications like video-on-demand have high availability requirements. In the event of server failure, streams fr...
TASE
2008
IEEE
13 years 6 months ago
2008
IEEE
Abstract--Cluster tools are widely used as semiconductor manufacturing equipment. While throughput analysis and scheduling of single-cluster tools have been well-studied, research ...