Efficient kNN Computation for Multiple Query Points on Road Network

International Journal of Grid and Distributed Computing - Australia
doi 10.14257/ijgdc.2016.9.11.16
Full Text
Abstract

Available in full text

Date
Authors
Publisher

NADIA

Related search

Efficient Successor Retrieval Operations for Aggregate Query Processing on Clustered Road Networks

Information Sciences
ControlSystems EngineeringManagementTheoretical Computer ScienceComputer Science ApplicationsInformation SystemsArtificial IntelligenceSoftware
2010English

Nearest Neighbor Secure Query Research for Spatial Road Network Data

2019English

Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

Springer Tracts in Advanced Robotics
Electronic EngineeringElectricalArtificial Intelligence
2005English

A Direct Position-Determination Approach for Multiple Sources Based on Neural Network Computation

Sensors
InstrumentationInformation SystemsElectronic EngineeringBiochemistryAnalytical ChemistryMolecular Physics,ElectricalAtomicMedicineOptics
2018English

Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality

Journal of Artificial Intelligence Research
Artificial Intelligence
2013English

Efficient Computation of Adjusted P-Values for Resampling-Based Stepdown Multiple Testing

SSRN Electronic Journal
2016English

Computation Results of Finding All Efficient Points in Multiobjective Combinatorial Optimization

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2008English

Efficient Absolute Difference Circuit for SAD Computation on FPGA

International Journal of VLSI Design & Communication Systems
2019English

Efficient Sketches for the Set Query Problem

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy