Sciweavers

215 search results - page 41 / 43
» On the Linear Number of Matching Substrings
Sort
View
IRI
2007
IEEE
14 years 2 days ago
BESearch: A Supervised Learning Approach to Search for Molecular Event Participants
Biomedical researchers rely on keyword-based search engines to retrieve superficially relevant documents, from which they must filter out irrelevant information manually. Hence, t...
Richard Tzong-Han Tsai, Hong-Jie Dai, Hsi-Chuan Hu...
CCS
2007
ACM
13 years 12 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
Juan Ramón Troncoso-Pastoriza, Stefan Katze...
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
13 years 10 months ago
Zero-Knowledge Proofs with Witness Elimination
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...
Aggelos Kiayias, Hong-Sheng Zhou
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 10 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
HPCN
1997
Springer
13 years 10 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher