%0 Conference Paper %1 conf/coolchips/ZhangYN15 %A Zhang, Anna %A Yao, Jun %A Nakashima, Yasuhiko %B COOL Chips %D 2015 %I IEEE Computer Society %K dblp %P 1-3 %T Lowering the complexity of k-means clustering by BFS-dijkstra method for graph computing. %U http://dblp.uni-trier.de/db/conf/coolchips/coolchips2015.html#ZhangYN15 %@ 978-1-4673-7325-8

@inproceedings{conf/coolchips/ZhangYN15, added-at = {2023-03-23T00:00:00.000+0100}, author = {Zhang, Anna and Yao, Jun and Nakashima, Yasuhiko}, biburl = {https://www.bibsonomy.org/bibtex/29266906e51fce1024b276810711e7cad/dblp}, booktitle = {COOL Chips}, crossref = {conf/coolchips/2015}, ee = {https://doi.ieeecomputersociety.org/10.1109/CoolChips.2015.7158653}, interhash = {5576910cc89884498e9ecb2c0e247c82}, intrahash = {9266906e51fce1024b276810711e7cad}, isbn = {978-1-4673-7325-8}, keywords = {dblp}, pages = {1-3}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T10:16:55.000+0200}, title = {Lowering the complexity of k-means clustering by BFS-dijkstra method for graph computing.}, url = {http://dblp.uni-trier.de/db/conf/coolchips/coolchips2015.html#ZhangYN15}, year = 2015 }