72 search results - page 4 / 15 » What can be efficiently reduced to the Kolmogorov-random str... |
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
SODA
1990
ACM
13 years 9 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
TITB
2010
13 years 3 months ago
2010
Mobile sensor-based systems are emerging as promising platforms for healthcare monitoring. An important goal of these systems is to extract physiological information about the subj...
JDA
2008
13 years 8 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...