4850 search results - page 267 / 970 » Proof and Computation in Geometry |
175
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
178
click to vote
ASM
2008
ASM
15 years 8 months ago
2008
ASM
The ingredients of typical model based development via refinement are re-examined, and some well known frameworks are reviewed in that light, drawing out commonalities and differen...
226
click to vote
JFPLC
2004
15 years 8 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
147
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
177
Voted
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...