Description: Local sensitive hashing algorithm to find and recall data. Find the nearest neighbor can be achieved, local sensitive hash algorithm to find and compare the recall.
To Search:
File list (Check if you may need any files):
E2LSH-0.1
.........\Makefile
.........\bin
.........\...\compile
.........\...\exact
.........\...\lsh
.........\...\lsh_computeParams
.........\...\lsh_fromParams
.........\gpl.txt
.........\manual.ps
.........\mnist1k.dts
.........\mnist1k.q
.........\sources
.........\.......\BasicDefinitions.h
.........\.......\BucketHashing.cpp
.........\.......\BucketHashing.h
.........\.......\Geometry.cpp
.........\.......\Geometry.h
.........\.......\GlobalVars.cpp
.........\.......\GlobalVars.h
.........\.......\LSHMain.cpp
.........\.......\LocalitySensitiveHashing.cpp
.........\.......\LocalitySensitiveHashing.h
.........\.......\NearNeighbors.cpp
.........\.......\NearNeighbors.h
.........\.......\Random.cpp
.........\.......\Random.h
.........\.......\SelfTuning.cpp
.........\.......\SelfTuning.h
.........\.......\Util.cpp
.........\.......\Util.h
.........\.......\compareOutputs.cpp
.........\.......\convertMNIST.cpp
.........\.......\exactNNs.cpp
.........\.......\genDS.cpp
.........\.......\genPlantedDS.cpp
.........\.......\headers.h
.........\.......\testFloat.cpp