An optimal algorithm for approximate nearest neighbor searching fixed dimensions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Fast Parallel Estimation of High Dimensional Information Theoretical Quantities with Low Dimensional Random Projection Ensembles
- Detecting Deviating Data Cells
- Similarity, kernels, and the fundamental constraints on cognition
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- Nearest neighbors weighted composite likelihood based on pairs for (non-)Gaussian massive spatial data with an application to Tukey-hh random fields estimation
- Maximum-likelihood approximate nearest neighbor method in real-time image recognition
- A computational approach for hypersonic nonequilibrium radiation utilizing space partition algorithm and Gauss quadrature
- A numerical algorithm for multidimensional modeling of scattered data points
- A stabilized finite element method using a discontinuous level set approach for the computation of bubble dynamics
- Geodesic spanners for points on a polyhedral terrain
- Probably correct \(k\)-nearest neighbor search in high dimensions
- A Bayesian approach for comparing cross-validated algorithms on multiple data sets
- Partition of unity interpolation using stable kernel-based techniques
- Counts-of-counts similarity for prediction and search in relational data
- Transient adaptivity applied to two-phase incompressible flows
- Approximate distance-comparison-preserving symmetric encryption
- On approximate nearest neighbors under \(l_\infty\) norm
- Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
- A quadrature-free discontinuous Galerkin method for the level set equation
- Practical methods for shape fitting and kinetic data structures using coresets
- Virtuaschlieren: a hybrid GPU/CPU-based schlieren simulator for ideal and non-ideal compressible-fluid flows
- Computational singular perturbation with non-parametric tabulation of slow manifolds for time integration of stiff chemical kinetics
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- An efficient trivariate algorithm for tetrahedral Shepard interpolation
- Image classification based on quantum K-nearest-neighbor algorithm
- IGA-suitable planar parameterization with patch structure simplification of closed-form polysquare
- ESTIMATING SURFACE NORMALS IN NOISY POINT CLOUD DATA
- scientific article; zbMATH DE number 1953148 (Why is no real title available?)
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- Efficient sparse ICP
- Batch active learning for multispectral and hyperspectral image segmentation using similarity graphs
- Toward quantifying vertex similarity in networks
- (1+)-ANN data structure for curves via subspaces of bounded doubling dimension
- Approximate similarity search: a multi-faceted problem
- A modified bubble placement method and its application in solving elliptic problem with discontinuous coefficients adaptively
- Efficiently approximating color-spanning balls
- On the number of incidences when avoiding an induced biclique in geometric settings
- A discrete mathematical model for chaotic dynamics in economics: Kaldor's model on business cycle
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- Chromatic nearest neighbor searching: A query sensitive approach
- Kinetic \(k\)-semi-Yao graph and its applications
- Geometric spanners for weighted point sets
- Two-dimensional Laplacianfaces method for face recognition
- Development and Application of Immersed Boundary Methods for Compressible Flows
- Fuzzy transform and least-squares approximation: Analogies, differences, and generalizations
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
- Index structures for fast similarity search for real vectors. II
- Efficient computation of partition of unity interpolants through a block-based searching technique
- kNN classification: a review
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- Fast-Match: fast affine template matching
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- Efficient Lagrangian particle tracking algorithms for distributed-memory architectures
- Kinetic reverse \(k\)-nearest neighbor problem
- Optimizing the geometrical accuracy of curvilinear meshes
- Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
- Fast computation of triangular Shepard interpolants
- Nearest neighbour group-based classification
- Geodesics on point clouds
- Fitting a C^m-smooth function to data. II
- Approximating spectral clustering via sampling: a review
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control
- Covering Minkowski sum boundary using points with applications
- Understanding the geometry of transport: diffusion maps for Lagrangian trajectory data unravel coherent sets
- The Euclidean k-supplier problem
- Dynamics-adapted cone kernels
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time
- Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data
- Multilabel classification with meta-level features in a learning-to-rank framework
- Scalable representation for 3D object recognition using feature sharing and view clustering
- Cycle bases of graphs and sampled manifolds
- Toward optimal -approximate nearest neighbor algorithms
- Extreme value theory for anomaly detection -- the GPD classifier
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information
- Quantum locally linear embedding for nonlinear dimensionality reduction
- A logarithmic-time solution to the point location problem for parametric linear programming
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
- Ramsey partitions and proximity data structures
- Approximate distance oracles for graphs with dense clusters
- Nearest-neighbor searching under uncertainty. I
- Spatiotemporal pattern extraction by spectral analysis of vector-valued observables
- Immersed-Boundary Methods for Simulating Human Motion Events
- More dynamic data structures for geometric set cover with sublinear update time
- Approximate range counting under differential privacy
- Consensus hashing
- scientific article; zbMATH DE number 1728331 (Why is no real title available?)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
- Familiarity based unified visual attention model for fast and robust object recognition
- Conic nearest neighbor queries and approximate Voronoi diagrams
- An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D
- Index structures for fast similarity search for real-valued vectors. I
- Firefly optimization to determine the precipitation field on South America
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Decomposing the complement of the union of cubes and boxes in three dimensions
- Meshfree, probabilistic determination of point sets and support regions for meshless computing
This page was built for publication: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158524)
