Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02982-0_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

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

ISPRS International Journal of Geo-Information
DevelopmentPlanetary SciencesComputers in Earth SciencesPlanningEarthGeography
2019English

Nearest Neighbor Secure Query Research for Spatial Road Network Data

2019English

Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data

Proceedings of the VLDB Endowment
Computer Science
2011English

Managing Continuous K-Nearest Neighbor Queries in Mobile Peer-To-Peer Networks

English

Efficient Algorithms and Cost Models for Reverse Spatial-Keywordk-Nearest Neighbor Search

ACM Transactions on Database Systems
Information Systems
2014English

Using Mapreduce for Efficient Parallel Processing of Continuous K Nearest Neighbors in Road Networks

Journal of Software and Systems Development
2016English

Efficient Nearest-Neighbor Search in the Probability Simplex

2013English

Space Efficient Data Structures for Nearest Larger Neighbor

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Similarity Between Euclidean and Cosine Angle Distance for Nearest Neighbor Queries

2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy