Sciweavers

1042 search results - page 123 / 209
» Failing First: An Update
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 4 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
ACMSE
2007
ACM
15 years 4 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
100
Voted
ACSAC
2009
IEEE
15 years 4 months ago
A Network Access Control Mechanism Based on Behavior Profiles
Abstract--Current Network Access Control (NAC) technologies manage the access of new devices into a network to prevent rogue devices from attacking network hosts or services. Typic...
Vanessa Frías-Martínez, Joseph Sherr...
ATAL
2007
Springer
15 years 4 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
116
Voted
PET
2010
Springer
15 years 4 months ago
Private Information Disclosure from Web Searches
As the amount of personal information stored at remote service providers increases, so does the danger of data theft. When connections to remote services are made in the clear and ...
Claude Castelluccia, Emiliano De Cristofaro, Danie...