Sciweavers

430 search results - page 61 / 86
» Efficient Proving for Practical Distributed Access-Control S...
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 12 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
CCS
2008
ACM
15 years 1 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
ISPEC
2010
Springer
15 years 1 months ago
Certificateless KEM and Hybrid Signcryption Schemes Revisited
Often authentication and confidentiality are required as simultaneous key requirements in many cryptographic applications. The cryptographic primitive called signcryption effective...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
SIAMSC
2008
173views more  SIAMSC 2008»
14 years 11 months ago
A Fast Iterative Method for Eikonal Equations
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
Won-Ki Jeong, Ross T. Whitaker
TSE
2010
125views more  TSE 2010»
14 years 10 months ago
Engineering a Sound Assertion Semantics for the Verifying Compiler
—The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or...
Patrice Chalin