Sciweavers

1262 search results - page 22 / 253
» Fast Robust Hashing
Sort
View
TALG
2008
124views more  TALG 2008»
13 years 10 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
ICALP
2009
Springer
14 years 11 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
VMV
2007
141views Visualization» more  VMV 2007»
14 years 3 hour ago
Distance Calculation between a Point and a Subdivision Surface
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Torsten Ullrich, Volker Settgast, Ulrich Krispel, ...
ISVC
2007
Springer
14 years 5 months ago
Integrative Geometric-Hashing Approaches to Binding Site Modeling and Ligand-Protein Interaction Prediction
Abstract. The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramo...
Joanna Lipinski-Kruszka, Rahul Singh
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
14 years 5 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen