-
Locality-Sensitive Hashing (LSH) is an algorithm for solving the (approximate/exact) Near Neighbor Search in high dimensional spaces.
-
The goal of this project is to design efficient algorithms for data streams. Such algorithms have very limited storage, and are required to process the information using only one pass over the data
-
A MIT guy on agent
-
An estimation for the time frame of ebook market
links for 2008-12-27
This entry was posted on 28/12/2008 (Sunday) at 1:01 am and is filed under 網路書簽. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.
Printed from: http://www.mingli-yuan.info/archives/299 .
© Mingli Yuan 2010.
© Mingli Yuan 2010.