203 search results - page 33 / 41 » An O(nlogn) time algorithm for optimal buffer insertion |
104
click to vote
SIGGRAPH
1994
ACM
15 years 5 months ago
1994
ACM
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
111
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
103
click to vote
INFOCOM
2010
IEEE
15 years 5 days ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
104
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...