Sciweavers

703 search results - page 7 / 141
» Efficient anonymity-preserving data collection
Sort
View
TMC
2012
12 years 1 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
CIKM
1993
Springer
14 years 3 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
VTC
2008
IEEE
124views Communications» more  VTC 2008»
14 years 5 months ago
Efficient Reliable Data Collection in Wireless Sensor Networks
— We propose an Efficient Reliable Data Collection (eRDC) algorithm. The eRDC is designed for energy-constraint wireless sensor networks (WSN) to balance reliability and energy c...
Ren Ping Liu, John Zic, Iain B. Collings, Alex Y. ...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 11 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov