Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Hisanori Kajiyama
@inproceedings{DBLP:conf/gis/HayashiTSKKI09, author = {Hideki Hayashi and Masaaki Tanizaki and Akiko Sato and Kohji Kimura and Hisanori Kajiyama and Masanori Irie}, editor = {Divyakant Agrawal and Walid G. Aref and Chang{-}Tien Lu and Mohamed F. Mokbel and Peter Scheuermann and Cyrus Shahabi and Ouri Wolfson}, title = {Spatial search processing in embedded devices}, booktitle = {17th {ACM} {SIGSPATIAL} International Symposium on Advances in Geographic Information Systems, {ACM-GIS} 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings}, pages = {516--519}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1653771.1653858}, doi = {10.1145/1653771.1653858}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/gis/HayashiTSKKI09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gis/HayashiITKK08, author = {Hideki Hayashi and Daisuke Ito and Masaaki Tanizaki and Kohji Kimura and Hisanori Kajiyama}, editor = {Walid G. Aref and Mohamed F. Mokbel and Markus Schneider}, title = {Dual-heap \emph{k}NN: \emph{k}-nearest neighbor search for spatial data retrieval in embedded {DBMS}}, booktitle = {16th {ACM} {SIGSPATIAL} International Symposium on Advances in Geographic Information Systems, {ACM-GIS} 2008, November 5-7, 2008, Irvine, California, USA, Proceedings}, pages = {40}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1463434.1463484}, doi = {10.1145/1463434.1463484}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/gis/HayashiITKK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.