On finding the closest bitwise matches in a fixed set

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Peter Klier Univ. of California at Berkeley
Richard J. Fateman Univ. of California at Berkeley
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 17 Issue 1, March 1991
Pages 88-97
ACM New York, NY, USA
table of contents doi>10.1145/103147.103157
On finding the closest bitwise matches in a fixed set Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 234
· Citation Count: 0


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