Sciweavers

156 search results - page 13 / 32
» Random Access to Abstract Data Types
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 2 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
USENIX
2008
13 years 9 months ago
Measurement and Analysis of Large-Scale Network File System Workloads
In this paper we present the analysis of two large-scale network file system workloads. We measured CIFS traffic for two enterprise-class file servers deployed in the NetApp data ...
Andrew W. Leung, Shankar Pasupathy, Garth R. Goods...
ASPLOS
2012
ACM
12 years 3 months ago
Aikido: accelerating shared data dynamic analyses
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
Marek Olszewski, Qin Zhao, David Koh, Jason Ansel,...
INFOCOM
2007
IEEE
14 years 1 months ago
Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
Zhenzhen Ye, Alhussein A. Abouzeid, Jing Ai