Sciweavers

54 search results - page 7 / 11
» On the Analysis of Linear Probing Hashing
Sort
View
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 9 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...
RECOMB
2000
Springer
13 years 11 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
SIGIR
2010
ACM
13 years 11 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
BMCBI
2005
141views more  BMCBI 2005»
13 years 7 months ago
Construction and validation of the APOCHIP, a spotted oligo-microarray for the study of beta-cell apoptosis
Background: Type 1 diabetes mellitus (T1DM) is a autoimmune disease caused by a long-term negative balance between immune-mediated beta-cell damage and beta-cell repair/regenerati...
Nils E. Magnusson, Alessandra K. Cardozo, Mogens K...
PAMI
2008
156views more  PAMI 2008»
13 years 7 months ago
Tied Factor Analysis for Face Recognition across Large Pose Differences
Face recognition algorithms perform very unreliably when the pose of the probe face is different from the gallery face: typical feature vectors vary more with pose than with identi...
Simon J. D. Prince, James H. Elder, Jonathan Warre...