Sciweavers

206 search results - page 15 / 42
» Analysis of Multivariate Hash Functions
Sort
View
TSMC
2002
112views more  TSMC 2002»
13 years 9 months ago
An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
Liang Chen, Naoyuki Tokuda
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 11 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
BMCBI
2006
115views more  BMCBI 2006»
13 years 9 months ago
Multivariate curve resolution of time course microarray data
Background: Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), i...
Peter D. Wentzell, Tobias K. Karakach, Sushmita Ro...
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
12 years 2 days ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
EUROCRYPT
2008
Springer
13 years 11 months ago
Security/Efficiency Tradeoffs for Permutation-Based Hashing
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
Phillip Rogaway, John P. Steinberger