11214 search results - page 75 / 2243 » Just-in-time data structures |
DAGSTUHL
1996
13 years 11 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...
SODA
1994
ACM
13 years 11 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...
INFOCOM
2006
IEEE
14 years 4 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...
ISCAPDCS
2003
13 years 11 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 ...
ICDM
2007
IEEE
14 years 4 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...