First Page | Document Content | |
---|---|---|
Date: 2011-01-03 06:17:50Computing Data management Software Search algorithms Cluster analysis Machine learning Disjoint-set data structure Partition Trie Set Database Select | Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno SiebesAdd to Reading ListSource URL: eda.mmci.uni-saarland.deDownload Document from Source WebsiteFile Size: 587,40 KBShare Document on Facebook |
Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗DocID: 1qZUQ - View Document | |
Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno SiebesDocID: 1qYET - View Document | |
Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWENDocID: 1pSri - View Document | |
Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗DocID: 1poiO - View Document | |
PROD. TYPE: COM PP: 1-12 (col.fig.: nil) ED: Prathiba PAGN: Vidya -- SCAN: globalDocID: 1mRsU - View Document |