Sciweavers

11211 search results - page 95 / 2243
» Rank-Sensitive Data Structures
Sort
View
81
Voted
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
15 years 2 months ago
Approximate Data Structures with Applications
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...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
93
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
On the Potential of Structure-Free Data Aggregation in Sensor Networks
— 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...
Kai-Wei Fan, Sha Liu, Prasun Sinha
ISCAPDCS
2003
15 years 2 months ago
Parallel Relative Debugging with Dynamic Data Structures
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 ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
115
Voted
ICDM
2007
IEEE
199views Data Mining» more  ICDM 2007»
15 years 7 months ago
Discovering Structural Anomalies in Graph-Based Data
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...
William Eberle, Lawrence B. Holder
JASIS
2008
125views more  JASIS 2008»
15 years 21 days ago
A tool for data cube construction from structurally heterogeneous XML documents
Data cubes for OLAP (Online Analytical Processing) often need to be constructed from data located in several distributed and autonomous information sources. Such a data integratio...
Turkka Näppilä, Kalervo Järvelin, T...