Sciweavers

2272 search results - page 226 / 455
» Provable Data Privacy
Sort
View
108
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
DAGSTUHL
2004
15 years 2 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
TIP
2010
154views more  TIP 2010»
14 years 11 months ago
Projective Nonnegative Graph Embedding
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
Xiaobai Liu, Shuicheng Yan, Hai Jin
CIKM
2008
Springer
15 years 2 months ago
Privacy-preserving data publishing for horizontally partitioned databases
There is an increasing need for sharing data repositories containing personal information across multiple distributed, possibly untrusted, and private databases. Such data sharing...
Pawel Jurczyk, Li Xiong
140
Voted
PAKDD
2010
ACM
275views Data Mining» more  PAKDD 2010»
15 years 4 months ago
Anonymizing Transaction Data by Integrating Suppression and Generalization
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
Junqiang Liu, Ke Wang