Fast Tweet Retrieval with Compact Binary Codes Weiwei Guo∗ Wei Liu† Mona Diab‡ Computer Science Department, Columbia University, New York, NY, USA † IBM T. J. Watson Research Center, Yorktown Heights, NY, USA ‡

First Page		Document Content
Date: 2014-08-08 12:20:25 Geometry Hamming Latent semantic analysis Locality-sensitive hashing Twitter Matrix Coding theory Information science Mathematics		Fast Tweet Retrieval with Compact Binary Codes Weiwei Guo∗ Wei Liu† Mona Diab‡ Computer Science Department, Columbia University, New York, NY, USA † IBM T. J. Watson Research Center, Yorktown Heights, NY, USA ‡ Add to Reading List Source URL: anthology.aclweb.org Download Document from Source Website File Size: 279,25 KB Share Document on Facebook

	Lecture 9: Tues Feb 14: Superdense Coding OK, now on to some new stuff! Superdense Coding is the first protocol we’ll see that requires entanglement. Basic information theory (Shannon) tells us that “by sending bits, DocID: 1xVqR - View Document
	QcBits: constant-time small-key code-based cryptography Tung Chou Technische Universiteit Eindhoven, The Netherlands Coding theory DocID: 1vexc - View Document
	a Cimpa-ICTP research school on Lattices and application to cryptography and coding theory Saigon University, Ho Chi Minh City, August 1st-12th 2016 International Participants 1 Ankur DocID: 1uNEl - View Document
	Preventing Pollution Attacks in Multi-Source Network Coding Dan Boneh† Stanford University, USA Shweta Agrawal∗ DocID: 1uibH - View Document