4541 search results - page 53 / 909 » Cache-Oblivious Algorithms and Data Structures |
SIGCSE
2004
ACM
15 years 4 months ago
2004
ACM
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
152
click to vote
BMCBI
2010
14 years 8 months ago
2010
Background: Genomewide association studies have resulted in a great many genomic regions that are likely to harbor disease genes. Thorough interrogation of these specific regions ...
104
click to vote
IV
2003
IEEE
15 years 4 months ago
2003
IEEE
This paper describes a radial layout method for displaying B+ -tree data structures. We present an algorithmic framework for computing the node positions that result in a planar d...
114
Voted
TIC
2000
Springer
15 years 2 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
SIAMCOMP
1998
14 years 10 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...