Sciweavers

915 search results - page 21 / 183
» Proof labeling schemes
Sort
View
DCC
2010
IEEE
13 years 8 months ago
Comparing two pairing-based aggregate signature schemes
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...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
QEST
2005
IEEE
14 years 1 months ago
An approximation algorithm for labelled Markov processes: towards realistic approximation
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
Alexandre Bouchard-Côté, Norm Ferns, ...
AI
2007
Springer
13 years 8 months ago
The Carneades model of argument and burden of proof
We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation. The model applies proof stan...
Thomas F. Gordon, Henry Prakken, Douglas Walton
EDBTW
2004
Springer
14 years 1 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...
LICS
2003
IEEE
14 years 1 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais