Efficient algorithms for approximate member extraction using signature-based inverted lists

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jiaheng Lu Renmin University of China, Beijing, China
Jialong Han Renmin University of China, Beijing, China
Xiaofeng Meng Renmin University of China, Beijing, China
Published in:
Cover Image
 
· Proceeding
CIKM '09 Proceedings of the 18th ACM conference on Information and knowledge management
Pages 315-324
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-512-3 doi>10.1145/1645953.1645995
Efficient algorithms for approximate member extraction using signature-based inverted lists Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 32
· Downloads (cumulative): 214
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder