Sciweavers

5891 search results - page 432 / 1179
» On the Computational Security of a Distributed Key Distribut...
Sort
View
ICNP
2009
IEEE
15 years 5 months ago
Memory Efficient Protocols for Detecting Node Replication Attacks in Wireless Sensor Networks
Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a...
Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelia...
ICS
2010
Tsinghua U.
16 years 12 days ago
Cache oblivious parallelograms in iterative stencil computations
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak, Ha...
ISPA
2005
Springer
16 years 1 months ago
Redundancy Schemes for High Availability in DHTs
High availability in peer-to-peer DHTs requires data redundancy. This paper takes user download behavior into account to evaluate redundancy schemes in data storage and share syste...
Fan Wu, Tongqing Qiu, YueQuan Chen, Guihai Chen
QSHINE
2005
IEEE
16 years 1 months ago
Achieving Weighted Fairness between Uplink and Downlink in IEEE 802.11 DCF-Based WLANs
In this paper, we first propose an analytical model of WLANs (Wireless LANs) with an arbitrary backoff distribution and AIFS (Arbitration Inter-Frame Space). From the analysis, we ...
Jiwoong Jeong, Sunghyun Choi, Chong-kwon Kim
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting