Sciweavers

33 search results - page 3 / 7
» Worst-Case Optimal Tree Layout in a Memory Hierarchy
Sort
View
FOCS
1989
IEEE
13 years 9 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
IPPS
1998
IEEE
13 years 10 months ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka
ICML
2004
IEEE
14 years 6 months ago
Large margin hierarchical classification
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
Ofer Dekel, Joseph Keshet, Yoram Singer
IFL
2000
Springer
13 years 9 months ago
Improving Cache Effectiveness through Array Data Layout Manipulation in SAC
Sac is a functional array processing language particularly designed with numerical applications in mind. In this field the runtime performance of programs critically depends on the...
Clemens Grelck
INFOVIS
1997
IEEE
13 years 10 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner