Sciweavers

1134 search results - page 222 / 227
» Distributed Proving in Access-Control Systems
Sort
View
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
15 years 10 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
15 years 9 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 9 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
PODS
2008
ACM
165views Database» more  PODS 2008»
15 years 9 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
CTRSA
2009
Springer
151views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Key-Private Proxy Re-encryption
Proxy re-encryption (PRE) allows a proxy to convert a ciphertext encrypted under one key into an encryption of the same message under another key. The main idea is to place as lit...
Giuseppe Ateniese, Karyn Benson, Susan Hohenberger