Sciweavers

4137 search results - page 695 / 828
» On the number of matchings of a tree
Sort
View
PODC
2010
ACM
13 years 12 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 12 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
ESORICS
2009
Springer
13 years 12 months ago
Declassification with Explicit Reference Points
Noninterference requires that public outputs of a program must be completely independent from secrets. While this ensures that secrets cannot be leaked, it is too restrictive for m...
Alexander Lux, Heiko Mantel
AOSD
2007
ACM
13 years 11 months ago
Performance improvement for persistent systems by AOP
Efficient data retrieval from databases is a significant issue of the design of persistent systems. We propose an aspect oriented persistent system named AspectualStore. Aspectual...
Yasuhiro Aoki, Shigeru Chiba
AIMSA
2004
Springer
13 years 11 months ago
Identification of Communities of Peers by Trust and Reputation
In: Proceedings of the Eleventh International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-04), Springer-Verlag LNAI Series. c 2004 We present ...
Alessandro Agostini, Gianluca Moro