335 search results - page 11 / 67 » Compact Proofs of Retrievability |
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
JSAT
2008
13 years 7 months ago
2008
In this article we describe and evaluate optimized compact data structures for watching literals. Experiments with our SAT solver PicoSAT show that this low-level optimization not...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Given very few images containing a common object of interest under severe variations in appearance, we detect the common object and provide a compact visual representation of that...
TCC
2010
Springer
14 years 2 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...