A Scalable In-Memory Solution for Real-Time K Nearest Search on Road Network

References
Index Terms
- A Scalable In-Memory Solution for Real-Time K Nearest Search on Road Network
Recommendations
Aggregate k-nearest neighbors queries in time-dependent road networks
MobiGIS '15: Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information SystemsIn this paper we present an algorithm for processing aggregate nearest neighbor queries in time-dependent road networks, i.e., given a road network where the travel time over an edge is time-dependent, a set of query points Q, a set of points of ...
Confirmation Sampling for Exact Nearest Neighbor Search
Similarity Search and ApplicationsAbstractLocality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC ’98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate nearest ...
Complementary hashing for approximate nearest neighbor search
ICCV '11: Proceedings of the 2011 International Conference on Computer VisionRecently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral Hashing, expects better performance than the data-blind counterparts, e.g.,...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Chapter
Appears in

Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 9Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)7
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in