SIGN IN
SIGN UP
Data-oriented locality sensitive hashing
Full Text:
PDF
Buy this Article
Authors:
Wei Zhang
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
Ke Gao
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
Yong-dong Zhang
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
Jin-tao Li
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
2010 Article
Short paper
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 67
· Downloads (cumulative): 188
· Citation Count: 2
Published in:
· Proceeding
MM '10
Proceedings of the international conference on Multimedia
Pages 1131-1134
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-60558-933-6
doi>
10.1145/1873951.1874168
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximate nearest neighbor search
data-oriented locality sensitive hashing
performance
retrieval models
search process
similarity search
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder