11214 search results - page 75 / 2243 » Just-in-time data structures |
200
click to vote
DAGSTUHL
1996
15 years 8 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...
137
Voted
SODA
1994
ACM
15 years 8 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...
169
click to vote
INFOCOM
2006
IEEE
16 years 23 days 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...
177
click to vote
ISCAPDCS
2003
15 years 8 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 ...
188
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...