An optimal algorithm for approximate nearest neighbor searching fixed dimensions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Practical methods for shape fitting and kinetic data structures using coresets
- Approximate similarity search: a multi-faceted problem
- Fitting a C^m-smooth function to data. II
- The C^m norm of a function with prescribed jets. II
- An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
- Meshfree, probabilistic determination of point sets and support regions for meshless computing
- Chromatic nearest neighbor searching: A query sensitive approach
- Approximate range searching
- On approximate nearest neighbors under \(l_\infty\) norm
- Kinetic \(k\)-semi-Yao graph and its applications
- Efficient sparse ICP
- Reliable region predictions for automated valuation models
- Robust proximity search for balls using sublinear space
- Optimal selection of local approximants in RBF-PU interpolation
- Geodesics on point clouds
- Index structures for fast similarity search for real-valued vectors. I
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information
- Analysis of an adaptive algorithm to find the two nearest neighbors
- Dense neighborhoods on affinity graph
- Low-interference networks in metric spaces of bounded doubling dimension
- Image classification based on quantum K-nearest-neighbor algorithm
- Efficient computation of partition of unity interpolants through a block-based searching technique
- Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data
- Extreme value theory for anomaly detection -- the GPD classifier
- Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations
- Kaldor-Kalecki new model on business cycles
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- IGA-suitable planar parameterization with patch structure simplification of closed-form polysquare
- TSS: temporal similarity search measure for heterogeneous information networks
- GPU accelerated initialization of local maximum-entropy meshfree methods for vibrational and acoustic problems
- Fast-Match: fast affine template matching
- Counts-of-counts similarity for prediction and search in relational data
- A discrete mathematical model for chaotic dynamics in economics: Kaldor's model on business cycle
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
- Efficient data structures for model-free data-driven computational mechanics
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
- Discretizing Laplace-Beltrami operator from differential quantities
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Finding representative landmarks of data on manifolds
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN
- Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme
- Maximum-likelihood approximate nearest neighbor method in real-time image recognition
- Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
- Monte Carlo simulation of radiative transfer in a medium with varying refractive index specified at discrete points
- An efficient trivariate algorithm for tetrahedral Shepard interpolation
- Spatiotemporal pattern extraction by spectral analysis of vector-valued observables
- An immersed boundary method coupled with a dynamic overlapping-grids strategy
- A numerical algorithm for multidimensional modeling of scattered data points
- Randomized partition trees for nearest neighbor search
- Nonlocal PDEs on graphs: from tug-of-war games to unified interpolation on images and point clouds
- Optimizing the geometrical accuracy of curvilinear meshes
- A stabilized finite element method using a discontinuous level set approach for the computation of bubble dynamics
- Partition of unity interpolation using stable kernel-based techniques
- Nearest-neighbor searching under uncertainty. I
- Virtuaschlieren: a hybrid GPU/CPU-based schlieren simulator for ideal and non-ideal compressible-fluid flows
- Fast computation of triangular Shepard interpolants
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- Scalable representation for 3D object recognition using feature sharing and view clustering
- Transient adaptivity applied to two-phase incompressible flows
- Deformable spanners and applications
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
- Similarity, kernels, and the fundamental constraints on cognition
- A quadrature-free discontinuous Galerkin method for the level set equation
- Robust multi-view feature matching from multiple unordered views
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
- Familiarity based unified visual attention model for fast and robust object recognition
- Matching sets of line segments
- Computational approximations of compact metric spaces
- A partitioning column approach for solving LED sorter manipulator path planning problems
- Quantum locally linear embedding for nonlinear dimensionality reduction
- Toward optimal -approximate nearest neighbor algorithms
- scientific article; zbMATH DE number 1728331 (Why is no real title available?)
- Efficiently approximating color-spanning balls
- Firefly optimization to determine the precipitation field on South America
- Efficient three-dimensional scene modeling and mosaicing
- Kinetic reverse \(k\)-nearest neighbor problem
- Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
- Approximate nearest neighbor search under translation invariant Hausdorff distance
- scientific article; zbMATH DE number 1003290 (Why is no real title available?)
- Approximating spectral clustering via sampling: a review
- Truncated normal distribution-based EWMA control chart for monitoring the process mean in the presence of outliers
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- Neighborhood Property–Based Pattern Selection for Support Vector Machines
- On plane geometric spanners: a survey and open problems
- Fast Parallel Estimation of High Dimensional Information Theoretical Quantities with Low Dimensional Random Projection Ensembles
- Closest pair and the post office problem for stochastic points
- A computational approach for hypersonic nonequilibrium radiation utilizing space partition algorithm and Gauss quadrature
- Fuzzy transform and least-squares approximation: Analogies, differences, and generalizations
- Multilabel classification with meta-level features in a learning-to-rank framework
- scientific article; zbMATH DE number 1953148 (Why is no real title available?)
- PCA-based branch and bound search algorithms for computing K nearest neighbors
- scientific article; zbMATH DE number 2065610 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- On clustering induced Voronoi diagrams
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time
- Understanding the geometry of transport: diffusion maps for Lagrangian trajectory data unravel coherent sets
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)
