11219 search results - page 57 / 2244 » Retroactive data structures |
117
Voted
FPLE
1995
15 years 6 months ago
1995
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...
142
click to vote
DAGSTUHL
1996
15 years 3 months ago
1996
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...
95
Voted
SODA
1994
ACM
15 years 3 months ago
1994
ACM
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...
137
Voted
SIAMCOMP
1998
15 years 2 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 ...
107
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree...