A multiple tree algorithm for the efficient association of asteroid observations

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jeremy Kubica Carnegie Mellon University, Pittsburgh, PA
Andrew Moore Carnegie Mellon University, Pittsburgh, PA
Andrew Connolly University of Pittsburgh, Pittsburgh, PA
Robert Jedicke University of Hawaii, Honolulu, HI
A multiple tree algorithm for the efficient association of asteroid observations Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 35
· Downloads (cumulative): 481
· Citation Count: 2

Published in:
Cover Image
 
· Proceeding
KDD '05 Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Pages 138-146
ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-135-X doi>10.1145/1081870.1081889

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