494 search results - page 32 / 99 » Heap Building Bounds |
146
click to vote
CG
2008
Springer
15 years 4 months ago
2008
Springer
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
220
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
125
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
168
click to vote
OOPSLA
2007
Springer
15 years 10 months ago
2007
Springer
Java performance is far from being trivial to benchmark because it is affected by various factors such as the Java application, its input, the virtual machine, the garbage collect...
153
Voted
JCT
2006
15 years 3 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...