Filters








2,684 Hits in 8.6 sec

A road network embedding technique for k-nearest neighbor search in moving object databases

Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Sharifzadeh
<span title="">2002</span> <i title="ACM Press"> Proceedings of the tenth ACM international symposium on Advances in geographic information systems - GIS &#39;02 </i> &nbsp;
In this paper, we apply an embedding technique to transform a road network to a high dimensional space in order to utilize computationally simple Minkowski metrics for distance measurement.  ...  A very important class of queries in GIS applications is the class of K-nearest neighbor queries.  ...  Achnowledgments This research has been funded in part by NSF grants EEC-9529152 (IMSC ERC), IIS-0238560 (CAREER) and IIS-0082826, NIH-NLM grant nr.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/585163.585167">doi:10.1145/585163.585167</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lmhx6kap3jg5tg3sat2pcshs4e">fatcat:lmhx6kap3jg5tg3sat2pcshs4e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061022225811/http://infolab.usc.edu:80/DocsDemos/geoinformatica03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d6/54/d654fc87beed8dfaebc8c6db8e758b661364c2e9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/585163.585167"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A road network embedding technique for k-nearest neighbor search in moving object databases

Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Sharifzadeh
<span title="">2002</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q6tw7qmnszfgbikw4mpyjrokkm" style="color: black;">Proceedings of the tenth ACM international symposium on Advances in geographic information systems - GIS &#39;02</a> </i> &nbsp;
In this paper, we apply an embedding technique to transform a road network to a high dimensional space in order to utilize computationally simple Minkowski metrics for distance measurement.  ...  A very important class of queries in GIS applications is the class of K-nearest neighbor queries.  ...  Achnowledgments This research has been funded in part by NSF grants EEC-9529152 (IMSC ERC), IIS-0238560 (CAREER) and IIS-0082826, NIH-NLM grant nr.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/585147.585167">doi:10.1145/585147.585167</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gis/ShahabiKS02.html">dblp:conf/gis/ShahabiKS02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uaju4i6ryrbirgdozynimqqyem">fatcat:uaju4i6ryrbirgdozynimqqyem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061022225811/http://infolab.usc.edu:80/DocsDemos/geoinformatica03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d6/54/d654fc87beed8dfaebc8c6db8e758b661364c2e9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/585147.585167"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Privacy Protected Query Processing on Spatial Networks

Wei-Shinn Ku, Roger Zimmermann, Wen-Chih Peng, Sushama Shroff
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2007 IEEE 23rd International Conference on Data Engineering Workshop</a> </i> &nbsp;
In this paper, we present two novel query algorithms, PSNN and PSRQ, for answering nearest neighbor queries and range queries on spatial networks without revealing private information of the query initiator  ...  The effectiveness of our privacy protected algorithms has been validated using real world road networks. In addition, we demonstrate the appeal of our technique using extensive simulation results.  ...  Acknowledgements This research has been funded in part by NSF ITR grant CMS-0219463, IIS-0534761, equipment gifts from Intel and Hewlett-Packard, and by the Integrated Media Systems Center, a National  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdew.2007.4400994">doi:10.1109/icdew.2007.4400994</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/KuZPS07.html">dblp:conf/icde/KuZPS07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aanbnn5dyzbhnoqfgncq6gwevu">fatcat:aanbnn5dyzbhnoqfgncq6gwevu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809020758/http://www.eng.auburn.edu/~weishinn/Comp7120/PDM07_Ku.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4b/78/4b78be1b3527e7f3a05f8ceb8e21e642ff6d2852.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdew.2007.4400994"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Privacy Protected Spatial Query Processing for Advanced Location Based Services

Wei-Shinn Ku, Yu Chen, Roger Zimmermann
<span title="2008-10-10">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5ldpa66mwbhejga74di7sle7j4" style="color: black;">Wireless personal communications</a> </i> &nbsp;
In this paper, we propose an effective location cloaking mechanism based on spatial networks and two novel query algorithms, PSNN and PSRQ, for answering nearest neighbor queries and range queries on spatial  ...  In addition, we demonstrate the appeal of our technique using extensive simulation results.  ...  Searching k network nearest neighbors with PSNN where the cloaked area contains k objects (k = 1 in this example).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11277-008-9608-9">doi:10.1007/s11277-008-9608-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jfgps4kgdjdppjk66hf663fbde">fatcat:jfgps4kgdjdppjk66hf663fbde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705063604/http://eiger.ddns.comp.nus.edu.sg/pubs/privacyprotectedspatialqueries-wpc2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/4f/f84f31e8d9c7224f035bbcca7d6c340f650b7d7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11277-008-9608-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fast Nearest Neighbor Search on Road Networks [chapter]

Haibo Hu, Dik Lun Lee, Jianliang Xu
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper, we propose a new approach that indexes the network topology based on a novel network reduction technique.  ...  An nd index is developed for each SPIE and our new (k)NN search algorithms on an SPIE follow a predetermined tree path to avoid costly network expansion.  ...  Shahabi et al. applied graph embedding techniques to kNN search on road networks [11] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11687238_14">doi:10.1007/11687238_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ja65xgwn5nftjkseujo42mo6ja">fatcat:ja65xgwn5nftjkseujo42mo6ja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110725070816/http://www.cse.ust.hk:80/~dlee/Papers/mobile/edbt06-road-networks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/98/db98b38d51842f94cde129e9cd6c4c1768273b03.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11687238_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Proximity queries in large traffic networks

Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Matthias Renz, Tim Schmidt
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q6tw7qmnszfgbikw4mpyjrokkm" style="color: black;">Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems - GIS &#39;07</a> </i> &nbsp;
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs.  ...  These distance approximations can be used within a filter step to prune true drops and true hits as well as in the refinement step in order to guide an informed A* search.  ...  The most prominent proximity queries in road networks are distance range queries (DRQ) and k-nearest neighbor queries (kNNQ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1341012.1341040">doi:10.1145/1341012.1341040</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gis/KriegelKKRS07.html">dblp:conf/gis/KriegelKKRS07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yxn6vq5yzrg73kixpw2ffxurr4">fatcat:yxn6vq5yzrg73kixpw2ffxurr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808055637/http://www.dbs.informatik.uni-muenchen.de/Publikationen/Papers/ACMGIS07_ProxQueries.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/24/bd/24bdb687f8188c27ee5838d603386ee296b599eb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1341012.1341040"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases [chapter]

Ugur Demiryurek, Farnoush Banaei-Kashani, Cyrus Shahabi
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications.  ...  In this paper, for the first time we study a generalized form of this problem, called the Time-Dependent k Nearest Neighbor problem (TD-kNN) with which edge-weights are time variable.  ...  Time-dependent k Nearest Neighbor Query (TD-kNN) A time-dependent k nearest neighbor query on spatial networks is defined as a query that finds the k nearest neighbors of a query object moving on a time-dependent  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-12038-1_20">doi:10.1007/978-3-642-12038-1_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mwbyljkj75fxflcqjfrkfkt44i">fatcat:mwbyljkj75fxflcqjfrkfkt44i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809072637/http://infolab.usc.edu/DocsDemos/DNIS_2010.pdf?origin=publication_detail" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/fa/f6fabc7356259ee5c4e7c8ca00fd86a772dbf3d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-12038-1_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient Query Processing in Large Traffic Networks

Hans-Peter Kriegel, Peer Kroger, Peter Kunath, Matthias Renz, Tim Schmidt
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2008 IEEE 24th International Conference on Data Engineering</a> </i> &nbsp;
We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph.  ...  In addition, we discuss how the computation of the exact shortest path distance in the refinement step can be boosted by using the embedded graph.  ...  Let D be a database of objects that are located in a traffic network, e.g. cars or pedestrians in a network of streets.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2008.4497586">doi:10.1109/icde.2008.4497586</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/KriegelKKRS08.html">dblp:conf/icde/KriegelKKRS08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kqyryhz22jgolcyey57gj3ofge">fatcat:kqyryhz22jgolcyey57gj3ofge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829084321/http://www.dbs.informatik.uni-muenchen.de/Publikationen/Papers/ICDE08_TrafficNetworks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/84/e784d9e749c0db34dc47d6ad2ff31015ed48ace6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2008.4497586"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An Efficient Technique for Distance Computation in Road Networks

Xu Jianqiu, Victor Almeida, Qin Xiaolin
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q4htbe6iofd7zjlr6cgteixwfq" style="color: black;">Fifth International Conference on Information Technology: New Generations (itng 2008)</a> </i> &nbsp;
Thus, many services in road networks such as nearest neighbor querying and the analysis of moving objects trajectories come into sight which present challenges to the database community.  ...  In this paper, we focus on this problem and propose a method for distance computation in road networks including the access of network connectivity information.  ...  Man Lung Yiu in Aalborg University for providing the library of E00 file converting. This work was supported by grant China National Natural Science Funding (69973022).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itng.2008.24">doi:10.1109/itng.2008.24</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/itng/JianqiuAX08.html">dblp:conf/itng/JianqiuAX08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l5xkx6fu3jg75cifombdehoohe">fatcat:l5xkx6fu3jg75cifombdehoohe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721194129/http://dna.fernuni-hagen.de/DistanceRoadNetworks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/a2/d4a20c5d26b3a10a62e13eb3544f0a782b2c6007.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itng.2008.24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

MobiPLACE*: A Distributed Framework for Spatio-Temporal Data Streams Processing Utilizing Mobile Clients' Processing Power [chapter]

Victor Zakhary, Hicham G. Elmongui, Magdy H. Nagi
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jajl7qtqc5cy7oavratsldrv2y" style="color: black;">Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering</a> </i> &nbsp;
We will extend the Query-Track-Participate(QTP) query processing model, introduced as a system architecture in PLACE*, by moving the Query server role to mobile clients.  ...  This will reduce memory and processing load on our regional servers in exchange for a little additional communication and memory load on mobile devices.  ...  We will focus on continuous range and k-NN (k Nearest Neighbor) queries on objects moving over road networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-11569-6_7">doi:10.1007/978-3-319-11569-6_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ttpjvgequfbhnbxfrxwzkgeqbu">fatcat:ttpjvgequfbhnbxfrxwzkgeqbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170712153629/https://cs.ucsb.edu/~victorzakhary/assets/papers/mobiquitous13-MobiPlaceStar.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a4/f2/a4f24f816be34e301503e71cbc54ddfd102ed740.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-11569-6_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Direction-Aware Continuous Moving K-Nearest-Neighbor Query in Road Networks

Dong, Yuan, Shang, Ye, Zhang
<span title="2019-08-29">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fw2uac7a5jggbfgqwh2wqy7yxu" style="color: black;">ISPRS International Journal of Geo-Information</a> </i> &nbsp;
Continuous K-nearest neighbor (CKNN) queries on moving objects retrieve the K-nearest neighbors of all points along a query trajectory.  ...  In order to find the top K-nearest objects move towards the query object within a period of time, this paper presents a novel algorithm of direction-aware continuous moving K-nearest neighbor (DACKNN)  ...  K-Nearest-Neighbor Query in Road Networks The K-nearest-neighbor query in road networks has been widely studied in the field of spatial databases. Papadias et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/ijgi8090379">doi:10.3390/ijgi8090379</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/47xf2izoufbmtcedlisoopkehq">fatcat:47xf2izoufbmtcedlisoopkehq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200213072544/https://res.mdpi.com/d_attachment/ijgi/ijgi-08-00379/article_deploy/ijgi-08-00379-v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/3f/633f3bb983580f81a82b4354890b6859473d5a27.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/ijgi8090379"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Natural Variability [chapter]

<span title="">2017</span> <i title="Springer International Publishing"> Encyclopedia of GIS </i> &nbsp;
In: Proceedings of the ACM SIG-MOD international conference on management of data, San Jose, pp 71-79 Nearest Neighbor Search k-NN Search in Time-Dependent Road Networks Trip Planning Queries in Road Network  ...  Therefore, the nearest neighbor search is one of the essential techniques in multimedia databases.  ...  Cartography principles provide the fundamental methods in separating computing objects into pieces to be calculated on different computers and abstracting computing objects into different levels to facilitate  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-17885-1_101534">doi:10.1007/978-3-319-17885-1_101534</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aj3jjedtq5ezbpoakmsuxw7pba">fatcat:aj3jjedtq5ezbpoakmsuxw7pba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180730162308/https://link.springer.com/content/pdf/10.1007%2F978-3-319-17885-1_101534.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/46/5a4692e8f68e6253abe0d4abf0c61342284ad424.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-17885-1_101534"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Pruning Strategies to Refine Resource List for NN Queries in Location based Services

A. Saravanan, S.R. Balasundaram
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kcayf4mk7zbrbhvdwizgrxaruu" style="color: black;">Procedia Technology - Elsevier</a> </i> &nbsp;
In case of nearest neighbor query, the list of resources represents those that are within a specified range from the query location.  ...  Also in case of road network based query execution, if there exist some resources that are not available in the road based resource database, they may not be added to the resource list.  ...  A graph embedding technique has been proposed by C. Shahabi et.al. for converting a road network to a high-dimensional Euclidean space and then the approximate k-NN was found [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.protcy.2012.10.072">doi:10.1016/j.protcy.2012.10.072</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/prabtqr63rfvppnm6fcev2o5c4">fatcat:prabtqr63rfvppnm6fcev2o5c4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002061842/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b1f/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMjIxMjAxNzMxMjAwNjE3Mg%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/7c/f97c9f0362550e926a97e6e5ba103804bc662e03.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.protcy.2012.10.072"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Data-driven trajectory smoothing

Frederic Chazal, Daniel Chen, Leonidas Guibas, Xiaoye Jiang, Christian Sommer
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q6tw7qmnszfgbikw4mpyjrokkm" style="color: black;">Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS &#39;11</a> </i> &nbsp;
The framework, which can be viewed of as a generalization of the classical moving average technique, naturally leads to efficient algorithms for various smoothing objectives.  ...  Motivated by the increasing availability of large collections of noisy GPS traces, we present a new data-driven framework for smoothing trajectory data.  ...  When the embedding dimension is high, a brute force nearest neighbor searching technique in lieu of the ANN library will most likely perform better.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2093973.2094007">doi:10.1145/2093973.2094007</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gis/ChazalCGJS11.html">dblp:conf/gis/ChazalCGJS11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hjvib7wd2bex7nlmlulri4tvsm">fatcat:hjvib7wd2bex7nlmlulri4tvsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809014028/http://geometry.stanford.edu/papers/ccgjs-dts-11/ccgjs-dts-11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/92/8c921be65d58243171eb6cdf59ac617181f22998.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2093973.2094007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Small codes and large image databases for recognition

Antonio Torralba, Rob Fergus, Yair Weiss
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ilwxppn4d5hizekyd3ndvy2mii" style="color: black;">2008 IEEE Conference on Computer Vision and Pattern Recognition</a> </i> &nbsp;
Using our codes on high quality labeled images from the LabelMe database gives surprisingly powerful recognition results using simple nearest neighbor techniques.  ...  Methods for efficiently searching this incredibly rich resource are vital for a large number of applications.  ...  Acknowledgments The authors would like to thank Geoff Hinton and Rus Salakhutdinov for making their RBM code available online.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cvpr.2008.4587633">doi:10.1109/cvpr.2008.4587633</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cvpr/TorralbaFW08.html">dblp:conf/cvpr/TorralbaFW08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/47tl537tzjejldlmtokrqipkfq">fatcat:47tl537tzjejldlmtokrqipkfq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808145837/http://mplab.ucsd.edu/wp-content/uploads/CVPR2008/Conference/data/papers/293.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b4/99/b4994fd9dda664dfb22868c5eec3acf2dafcd056.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cvpr.2008.4587633"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,684 results