11231 search results - page 53 / 2247 » Digging for Data Structures |
94
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...
136
click to vote
SIAMCOMP
1998
15 years 1 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 ...
106
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...
109
click to vote
ISCAPDCS
2003
15 years 3 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 ...
126
click to vote
ICDM
2007
IEEE
15 years 8 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...