Sciweavers

87 search results - page 8 / 18
» Two Generic Constructions of Probabilistic Cryptosystems and...
Sort
View
POS
1994
Springer
15 years 9 months ago
Changing Persistent Applications
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus...
Alex Farkas, Alan Dearle
161
Voted
CP
2004
Springer
15 years 9 months ago
Set Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Magnus Ågren
UAI
1993
15 years 6 months ago
On reasoning in networks with qualitative uncertainty
In this paper some initialwork towards a new approach to qualitative reasoning under uncertainty is presented. This method is not only applicable to qualitative probabilistic reas...
Simon Parsons, E. H. Mamdani
147
Voted
CCS
2004
ACM
15 years 11 months ago
Reusable cryptographic fuzzy extractors
We show that a number of recent definitions and constructions of fuzzy extractors are not adequate for multiple uses of the same fuzzy secret—a major shortcoming in the case of...
Xavier Boyen
TON
1998
93views more  TON 1998»
15 years 5 months ago
An evaluation of flow control in group communication
Abstract— Group communication services have been successfully used to construct applications with high availability, dependability, and real-time responsiveness requirements. Flo...
Shivakant Mishra, Lei Wu