Sciweavers

24 search results - page 3 / 5
» A simple transitive signature scheme for directed trees
Sort
View
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
13 years 5 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
ICALP
2005
Springer
13 years 10 months ago
Append-Only Signatures
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Bara...
LICS
2008
IEEE
13 years 11 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
ICIP
2009
IEEE
14 years 6 months ago
Principal Moments For Efficient Representation Of 2d Shape
The analytic signature is a recently proposed 2D shape representation scheme. It is tailored to the representation of shapes described by arbitrary sets of unlabeled points, or la...
CN
2010
149views more  CN 2010»
13 years 5 months ago
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem in the client/server paradigm. However, the...
Rubén Cuevas Rumín, Ángel Cue...