Optimizing parallel algorithms for all pairs similarity search.
Maha Ahmed Alabduljalil|Xun Tang|Tao Yang
| Anthology ID: | DBLP:conf/wsdm/AlabduljalilTY13 |
|---|---|
| Volume: | Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013 |
| Year: | 2013 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 203-212 |
| URL: | https://doi.org/10.1145/2433396.2433422 |
| DOI: | https://doi.org/10.1145/2433396.2433422 |
| DBLP: | conf/wsdm/AlabduljalilTY13 |
| BibTeX: |
@inproceedings{alabduljalil-2013-optimizing,
author = {Maha Ahmed Alabduljalil and
Xun Tang and
Tao Yang},
editor = {Stefano Leonardi and
Alessandro Panconesi and
Paolo Ferragina and
Aristides Gionis},
title = {{Optimizing parallel algorithms for all pairs similarity search}},
booktitle = {{Sixth ACM International Conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, February 4-8, 2013}},
pages = {203--212},
publisher = {ACM},
year = {2013},
url = {https://doi.org/10.1145/2433396.2433422},
doi = {https://doi.org/10.1145/2433396.2433422}
}