67 search results - page 7 / 14 » Common Substrings in Random Strings |
IPPS
1998
IEEE
14 years 24 days ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
FOCS
2000
IEEE
14 years 29 days ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
WWW
2010
ACM
14 years 27 days ago
2010
ACM
In this paper, we present a two-step language-independent spelling suggestion system. In the first step, candidate suggestions are generated using an Information Retrieval(IR) ap...
TCC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...