Sciweavers

144 search results - page 25 / 29
» Non-blocking binary search trees
Sort
View
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 9 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
COMCOM
2004
149views more  COMCOM 2004»
13 years 9 months ago
Accelerating network security services with fast packet classification
To protect a network, secure network systems such as intrusion detection system (IDS) and firewall are often installed to control or monitor network traffic. These systems often i...
Shiuh-Pyng Shieh, Fu-Yuan Lee, Ya-Wen Lin
CPAIOR
2005
Springer
14 years 3 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
WISEC
2010
ACM
13 years 7 months ago
Preventing multi-query attack in location-based services
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
Nilothpal Talukder, Sheikh Iqbal Ahamed
WINET
2010
128views more  WINET 2010»
13 years 8 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...