SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search Yingfan Liu‡ , Jiangtao Cui‡ , Zi Huang§ , Hui Li‡ , Heng Tao Shen§ ‡ School of Computer, Xidian University, China

First Page		Document Content
Date: 2014-04-05 17:13:23 Artificial intelligence Locality-sensitive hashing Hash function Hash table Nearest neighbor search Tiny Encryption Algorithm Cryptographic hash function Search algorithms Information science Information retrieval		SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search Yingfan Liu‡ , Jiangtao Cui‡ , Zi Huang§ , Hui Li‡ , Heng Tao Shen§ ‡ School of Computer, Xidian University, China Add to Reading List Source URL: www.vldb.org Download Document from Source Website File Size: 714,63 KB Share Document on Facebook

	1 New results on reduced-round Tiny Encryption Algorithm using genetic programming Karel Kubíˇcek, Jiˇrí Novotný, Petr Švenda, Martin Ukrop Masaryk University, Brno, Czech Republic DocID: 1vfW5 - View Document
	Efficient Cache Attacks on AES, and Countermeasures Eran Tromer1 2 , Dag Arne Osvik3 and Adi Shamir2 1 Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, DocID: 1rolT - View Document
	DayAfternoon I 14:30 – 16:00 DocID: 1rajI - View Document
	University of California, Berkeley – College of Engineering Spring 2014 Department of Electrical Engineering and Computer Sciences Instructor: Dr. Dan Garcia DocID: 1q8iS - View Document
	Microsoft Word - ISTQB_CTFL_Syll 2011.docx DocID: 1pZHU - View Document