Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: Locality-Sensitive Bloom Filter for Approximate Membership Query
Network Applications of Bloom Filters: A Survey
False Negative Problem of Counting Bloom Filter
SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search
Beyond Locality-Sensitive Hashing
Vectorized Bloom filters for advanced SIMD processors
Super-Bit Locality-Sensitive Hashing
Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams
In Defense of Locality-Sensitive Hashing
Adaptive Hashing for Fast Similarity Search
Composite Bloom Filters for Secure Record Linkage
ABS: a system for scalable approximate queries with accuracy guarantees
Fast locality-sensitive hashing
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Kernelized Locality-Sensitive Hashing
ATLAS: a probabilistic algorithm for high dimensional similarity search
Better than nothing privacy with bloom filters: to what extent?
Oblix: An Efficient Oblivious Search Index
BUFFALO: bloom filter forwarding architecture for large organizations
Efficient incremental near duplicate detection based on locality sensitive hashing
bloom filter applications in network security : a state - of - the - art survey .
Space/time trade-offs in hash coding with allowable errors
Magnesium in major depression
Free gait generation with reinforcement learning for a six-legged robot
Compact Hexaband PIFA Antenna for Mobile Handset Applications
Spectral Surface Reconstruction from Noisy