Sciweavers

989 search results - page 134 / 198
» Pebbling and Proofs of Work
Sort
View
WWW
2005
ACM
14 years 1 months ago
Shared lexicon for distributed annotations on the Web
The interoperability among distributed and autonomous systems is the ultimate challenge facing the semantic web. Heterogeneity of data representation is the main source of problem...
Paolo Avesani, Marco Cova
ACNS
2005
Springer
167views Cryptology» more  ACNS 2005»
14 years 1 months ago
Identity Based Encryption Without Redundancy
This paper presents a first example of secure identity based encryption scheme (IBE) without redundancy in the sense of Phan and Pointcheval. This modification of the Boneh-Frank...
Benoît Libert, Jean-Jacques Quisquater
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 1 months ago
A Lower Bound on List Size for List Decoding
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
Venkatesan Guruswami, Salil P. Vadhan
GPCE
2005
Springer
14 years 1 months ago
Statically Safe Program Generation with SafeGen
Abstract. SafeGen is a meta-programming language for writing statically safe generators of Java programs. If a program generator written in SafeGen passes the checks of the SafeGen...
Shan Shan Huang, David Zook, Yannis Smaragdakis
RTA
2005
Springer
14 years 1 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...