Daniel Lemire

Daniel Lemire

Indexing in Databases and Information Retrieval.

Most recent papers

Owen Kaser and Daniel Lemire, Compressed bitmap indexes: beyond unions and intersections, Software: Practice & Experience 46 (2), 2016. (Cited at least 3 times.)
Daniel Lemire and Leonid Boytsov, Decoding billions of integers per second through vectorization, Software: Practice & Experience 45 (1), 2015. (Cited at least 52 times.)
Xiaodan Zhu, Peter Turney, Daniel Lemire, Andre Vellino, Measuring academic influence: Not all citations are equal, Journal of the Association for Information Science and Technology 66 (2), 2015. (Cited at least 16 times.)
Recently cited papers

Daniel Lemire, Owen Kaser, Kamel Aouiche, Sorting improves word-aligned bitmap indexes, Data & Knowledge Engineering 69 (1), 2010. (Cited at least 65 times.)
Owen Kaser and Daniel Lemire, Tag-Cloud Drawing: Algorithms for Cloud Visualization, Tagging and Metadata for Social Information Organization (WWW 2007), 2007. (Cited at least 219 times.)
Daniel Lemire and Anna Maclachlan, Slope One Predictors for Online Rating-Based Collaborative Filtering, SDM ’05, 2005. (Cited at least 449 times.)
Want to know more about my research papers?

Recent International Conference Program Committees

ACM Conference on Information and Knowledge Management (ACM CIKM)
ACM Conference on Web Search and Data Mining (ACM WSDM)
ACM Conference on Information Retrieval (ACM SIGIR)
ACM Conference on Recommender Systems (ACM RecSys)
ACM/IEEE Joint Conference on Digital Libraries (JCDL)


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.