Sciweavers

40 search results - page 6 / 8
» Reserved-Length Prefix Coding
Sort
View
ACSAC
2002
IEEE
14 years 18 days ago
A Secure Directory Service based on Exclusive Encryption
We describe the design of a Windows file-system directory service that ensures the persistence, integrity, privacy, syntactic legality, and case-insensitive uniqueness of the name...
John R. Douceur, Atul Adya, Josh Benaloh, William ...
DCC
2010
IEEE
13 years 11 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
APN
2006
Springer
13 years 11 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
WIMOB
2007
IEEE
14 years 1 months ago
Performance Analysis of Ranging Process in IEEE 802.16e OFDMA Systems
In this paper, ranging process in IEEE 802.16e OFDMA systems is analyzed and performance is evaluated. Ranging process provides initial network entry, uplink synchronization, and ...
Doo Hwan Lee, Hiroyuki Morikawa