21 search results - page 3 / 5 » A Cache-Oblivious Implicit Dictionary with the Working Set P... |
PKC
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
XSYM
2010
Springer
13 years 4 months ago
2010
Springer
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
VISUALIZATION
1997
IEEE
13 years 10 months ago
1997
IEEE
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
ICSE
1999
IEEE-ACM
13 years 10 months ago
1999
IEEE-ACM
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...