Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
Efficient algorithms for reverse proximity query problems
Yokesh Kumar
,
Ravi Janardan
, Prosenjit Gupta
Computer Science and Engineering
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
6
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient algorithms for reverse proximity query problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Nearest Neighbor
100%
Reverse Nearest Neighbor
100%
Proximity Query
100%
High-order
50%
Approximation Algorithms
50%
DSPACE
50%
Query Point
50%
Order-k
50%
K-nearest Neighbor (K-NN)
50%
Bichromatic
50%
Convex Polytope
50%
Error Parameter
50%
GIS Application
50%
Influence Degree
50%
Geometric Transformation
50%
Any Dimension
50%
Computer Science
Approximation Algorithms
100%
Efficient Algorithm
100%
Varying Degree
100%
Primary Domain
100%
Geometric Transformation
100%
Mathematics
Nearest Neighbor
100%
Polytope
20%
Three-Dimension
20%
Two Dimensions
20%