Sciweavers

11212 search results - page 15 / 2243
» Semi-persistent Data Structures
Sort
View
MSV
2007
13 years 9 months ago
Visualizing the Inner Structure of N-Body Data Using Skeletonization
N-body simulations solve the n-body problem numerically and determine the trajectories of the n point masses. The result of these calculations is a huge amount of data detailing th...
Edward Dale, Hans-Peter Bischof
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 11 months ago
Alias Types for Recursive Data Structures
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 ...
David Walker, J. Gregory Morrisett
FPLE
1995
13 years 11 months ago
A Second Year Course on Data Structures Based on Functional Programming
In this paper, we make a proposal for a second year course on advanced programming, based on the functional paradigm. It assumes the existence of a first course on programming, al...
Manuel Núñez, Pedro Palao, Ricardo P...
DAGSTUHL
1996
13 years 8 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 8 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young