32545 search results - page 7 / 6509 » Data Structures and Algorithms |
ITNG
2007
IEEE
14 years 2 months ago
2007
IEEE
The Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients mu...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
PPOPP
2011
ACM
12 years 11 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...