Sciweavers

40 search results - page 6 / 8
» A survey of very large-scale neighborhood search techniques
Sort
View
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
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
14 years 1 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
NIPS
2003
13 years 8 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
DAMON
2006
Springer
13 years 9 months ago
B-tree indexes, interpolation search, and skew
Recent performance improvements in storage hardware have benefited bandwidth much more than latency. Among other implications, this trend favors large B-tree pages. Recent perform...
Goetz Graefe
BMCBI
2010
205views more  BMCBI 2010»
13 years 7 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...