11991 search results - page 141 / 2399 » Data Structure Fusion |
152
Voted
DAGSTUHL
1996
15 years 5 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...
106
click to vote
SODA
1994
ACM
15 years 5 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...
150
Voted
SIAMCOMP
1998
15 years 3 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 ...
122
click to vote
INFOCOM
2006
IEEE
15 years 10 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...
127
click to vote
ISCAPDCS
2003
15 years 5 months ago
2003
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...