Inproceedings,
A multiple tree algorithm for the efficient association of asteroid observations.
J. Kubica, A. Moore, A. Connolly, and R. Jedicke.KDD, page 138-146. ACM, (2005)
Meta data
- BibTeX key
- conf/kdd/KubicaMCJ05
- entry type
- inproceedings
- booktitle
- KDD
- year
- 2005
- pages
- 138-146
- publisher
- ACM
- crossref
- conf/kdd/2005
- ee
- https://doi.org/10.1145/1081870.1081889
- isbn
- 1-59593-135-X
- url
- http://dblp.uni-trier.de/db/conf/kdd/kdd2005.html#KubicaMCJ05
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/kdd/KubicaMCJ05
%A Kubica, Jeremy
%A Moore, Andrew W.
%A Connolly, Andrew J.
%A Jedicke, Robert
%B KDD
%D 2005
%E Grossman, Robert
%E Bayardo, Roberto J.
%E Bennett, Kristin P.
%I ACM
%K dblp
%P 138-146
%T A multiple tree algorithm for the efficient association of asteroid observations.
%U http://dblp.uni-trier.de/db/conf/kdd/kdd2005.html#KubicaMCJ05
%@ 1-59593-135-X
@inproceedings{conf/kdd/KubicaMCJ05,
added-at = {2023-06-26T00:00:00.000+0200},
author = {Kubica, Jeremy and Moore, Andrew W. and Connolly, Andrew J. and Jedicke, Robert},
biburl = {https://www.bibsonomy.org/bibtex/2045da1c25f34b85c8a93fca619e85c35/dblp},
booktitle = {KDD},
crossref = {conf/kdd/2005},
editor = {Grossman, Robert and Bayardo, Roberto J. and Bennett, Kristin P.},
ee = {https://doi.org/10.1145/1081870.1081889},
interhash = {088073876c2fe061249640e3d80ca013},
intrahash = {045da1c25f34b85c8a93fca619e85c35},
isbn = {1-59593-135-X},
keywords = {dblp},
pages = {138-146},
publisher = {ACM},
timestamp = {2024-04-10T13:59:45.000+0200},
title = {A multiple tree algorithm for the efficient association of asteroid observations.},
url = {http://dblp.uni-trier.de/db/conf/kdd/kdd2005.html#KubicaMCJ05},
year = 2005
}