Approximate counting by hashing in bounded arithmetic.
Emil JerábekPublished in: J. Symb. Log. (2009)
Keyphrases
- nearest neighbor searching
- order preserving
- approximate nearest neighbor
- data structure
- nearest neighbor search
- exact solution
- locality sensitive
- real time
- data sets
- hamming distance
- floating point
- similarity search
- random projections
- index structure
- locality sensitive hashing
- arithmetic operations
- multiscale
- social networks
- file organization
- linear hashing
- neural network