Sciweavers

502 search results - page 56 / 101
» Verifying Balanced Trees
Sort
View
COMGEO
2006
ACM
13 years 10 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
SPAA
1997
ACM
14 years 2 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 11 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
DAC
1998
ACM
14 years 11 months ago
Layout Techniques for Minimizing On-Chip Interconnect Self Inductance
Because magnetic e ects have a much longer spatial range than electrostatic e ects, an interconnect line with large inductance will be sensitive to distant variations in interconn...
Yehia Massoud, Steve S. Majors, Tareq Bustami, Jac...
ICCAD
2005
IEEE
95views Hardware» more  ICCAD 2005»
14 years 6 months ago
TACO: temperature aware clock-tree optimization
— In this paper, an efficient linear time algorithm TACO is proposed for the first time to minimize the worst case clock skew in the presence of on-chip thermal variation. TACO...
Minsik Cho, Suhail Ahmed, David Z. Pan