203 search results - page 23 / 41 » An O(nlogn) time algorithm for optimal buffer insertion |
VLDB
2004
ACM
14 years 2 days ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
LCTRTS
2010
Springer
14 years 1 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
SPAA
1999
ACM
13 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
SODA
1994
ACM
13 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
DATE
2002
IEEE
13 years 11 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...