Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Perceptrons: expanded edition
Neighborhood preserving hashing and approximate queries
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Sparse Distributed Memory
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Locality preserving dictionaries: theory & application to clustering in databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Low latency photon mapping using block hashing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient semantic search on DHT overlays
Journal of Parallel and Distributed Computing
Proceedings of the 15th ACM conference on Computer and communications security
Order-Preserving Symmetric Encryption
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the 2011 SIGGRAPH Asia Conference
Approximate message authentication and biometric entity authentication
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Compressive sensing using locality-preserving matrices
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |