Sciweavers

2252 search results - page 254 / 451
» Improving Random Forests
Sort
View
ASIACRYPT
2000
Springer
15 years 5 months ago
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
Danny Gutfreund, Michael Ben-Or
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
15 years 5 months ago
On the Exact Security of Full Domain Hash
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
Jean-Sébastien Coron
GCB
1997
Springer
77views Biometrics» more  GCB 1997»
15 years 5 months ago
Statistics of large scale sequence searching
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
Rainer Spang, Martin Vingron
ICIP
1994
IEEE
15 years 5 months ago
Multiresolution Detection of Coherent Radar Targets
Abstract--We develop and investigate several novel multiresolution algorithms for detecting coherent radar targets embedded in clutter. These multiresolution detectors exploit the ...
John D. Gorman, Nikola S. Subotic, Brian J. Thelen...
98
Voted
IPPS
1993
IEEE
15 years 5 months ago
Supporting Insertions and Deletions in Striped Parallel Filesystems
The dramatic improvements in the processing rates of parallel computers are turning many compute-bound jobs into IO-bound jobs. Parallel le systems have been proposed to better ma...
Theodore Johnson