17 search results - page 4 / 4 » New hook length formulas for binary trees |
MICRO
2002
IEEE
14 years 13 days ago
2002
IEEE
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
COMPGEOM
2003
ACM
14 years 23 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...