%0 Conference Paper %1 conf/dawak/KohP16 %A Koh, Jia-Ling %A Peng, Shao-Chun %B DaWaK %D 2016 %E Madria, Sanjay %E Hara, Takahiro %I Springer %K dblp %P 163-178 %T A Maximum Dimension Partitioning Approach for Efficiently Finding All Similar Pairs. %U http://dblp.uni-trier.de/db/conf/dawak/dawak2016.html#KohP16 %V 9829 %@ 978-3-319-43945-7

@inproceedings{conf/dawak/KohP16, added-at = {2019-10-19T00:00:00.000+0200}, author = {Koh, Jia-Ling and Peng, Shao-Chun}, biburl = {https://www.bibsonomy.org/bibtex/284b0328a2c0e36ae96695b72d179fe58/dblp}, booktitle = {DaWaK}, crossref = {conf/dawak/2016}, editor = {Madria, Sanjay and Hara, Takahiro}, ee = {https://doi.org/10.1007/978-3-319-43946-4_11}, interhash = {e1edb37cc9b8aad4b424a38dedba3fa1}, intrahash = {84b0328a2c0e36ae96695b72d179fe58}, isbn = {978-3-319-43945-7}, keywords = {dblp}, pages = {163-178}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-10-22T16:05:53.000+0200}, title = {A Maximum Dimension Partitioning Approach for Efficiently Finding All Similar Pairs.}, url = {http://dblp.uni-trier.de/db/conf/dawak/dawak2016.html#KohP16}, volume = 9829, year = 2016 }