Sciweavers

1192 search results - page 115 / 239
» Computing Weakest Readings
Sort
View
224
Voted
ICDE
1999
IEEE
140views Database» more  ICDE 1999»
16 years 4 months ago
Multiversion Reconciliation for Mobile Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allo...
Shirish Hemant Phatak, B. R. Badrinath
131
Voted
VLSID
2009
IEEE
220views VLSI» more  VLSID 2009»
16 years 4 months ago
A 7T/14T Dependable SRAM and its Array Structure to Avoid Half Selection
We propose a novel dependable SRAM with 7T cells and their array structure that avoids a half-selection problem. In addition, we introduce a new concept, "quality of a bit (Q...
Hidehiro Fujiwara, Shunsuke Okumura, Yusuke Iguchi...
120
Voted
PERCOM
2008
ACM
16 years 3 months ago
Cardinality Estimation for Large-scale RFID Systems
Counting or estimating the number of tags is crucial for large-scale RFID systems. The use of multiple readers was recently proposed to improve the efficiency and effectiveness in ...
Chen Qian, Hoilun Ngan, Yunhao Liu
138
Voted
PERCOM
2006
ACM
16 years 3 months ago
Resilient Aggregation with Attack Detection in Sensor Networks
In this paper, we propose a new model of resilient data aggregation in sensor networks, where the aggregator analyzes the received sensor readings and tries to detect unexpected d...
Levente Buttyán, Péter Schaffer, Ist...
117
Voted
PERCOM
2006
ACM
16 years 3 months ago
Using buddies to live longer in a boring world
In a sensor network monitoring natural environment, the readings of sensor nodes show high temporal and spatial correlation. This stems from the fact that most characteristics of ...
Samir Goel, Tomasz Imielinski, Andrea Passarella