Sciweavers

662 search results - page 43 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
PVLDB
2008
111views more  PVLDB 2008»
13 years 7 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 2 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 3 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
CSB
2005
IEEE
161views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Data Integration in the Mouse Genome Informatics (MGI) Database
The Mouse Genome Informatics (MGI) Database at The Jackson Laboratory provides a comprehensive public resource about the laboratory mouse. MGI curated data types include gene repr...
Donnie Qi, Judith A. Blake, James A. Kadin, Joel E...
IPSN
2007
Springer
14 years 1 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao