An Algorithm for Finding Best Matches in Logarithmic Expected Time
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The efficiency of using k-d trees for finding nearest neighbors in discrete space
- On neural network design. I: Using the MVQ algorithm
- Optimal choice of discriminators in a balanced K-D binary search tree
- The extendible cell method for closest point problems
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Approximate closest-point queries in high dimensions
- Analysis of range searches in quad trees
- Heuristic and optimization approaches to extending the Kohonen self organizing algorithm
- A simple measure of conditional dependence
- Approximating surfaces by moving total least squares method
- Algorithms for ordering unorganized points along parametrized curves
- Parallel solutions to geometric problems in the scan model of computation
- Noise reduction in chaotic time series using scaled probabilistic methods
- Estimating mutual information for feature selection in the presence of label noise
- A stochastic multiple mapping conditioning computational model in openfoam for turbulent combustion
- Fast model predictive control combining offline method and online optimization with K-D tree
- Scientific data interpolation with low dimensional manifold model
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
- On coupling particle filter trajectories
- Directional density measure to intrinsically estimate and counteract non-uniformity in point clouds
- Projection-based model reduction: formulations for physics-based machine learning
- An adaptive framework for costly black-box global optimization based on radial basis function interpolation
- Enhancing point symmetry-based distance for data clustering
- Asymptotic expansions of the \(k\) nearest neighbor risk
- A moving-box algorithm to estimate generalized dimensions and the \(f(\alpha)\) spectrum
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- A complete system for NN classification based on a VLSI array processor
- Accounting for boundary effects in nearest-neighbor searching
- Arbitrary 3D crack propagation with improved XFEM: accurate and efficient crack geometries
- Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization
- How to detect Wada basins
- Weighted quasi-interpolant spline approximations: properties and applications
- ForestDSH: a universal hash design for discrete probability distributions
- Projection-based model reduction of dynamical systems using space-time subspace and machine learning
- Adaptive sparse approximations of scattered data
- Fast model order reduction boundary element method for large-scale acoustic systems involving surface impedance
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- An approach to adaptive refinement for the RBF-FD method for 2D elliptic equations
- Strong form-based meshfree collocation method for wind-driven ocean circulation
- Fast neighbor search by using revised k-d tree
- The saddle-straddle method to test for Wada basins
- Geometric modeling of complex knitting stitches using a bicontinuous surface and its offsets
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- Efficient data structures for model-free data-driven computational mechanics
- A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data
- KNN and adaptive comfort applied in decision making for HVAC systems
- Chameleon based on clustering feature tree and its application in customer segmentation
- Fast high-dimensional node generation with variable density
- A numerical algorithm for multidimensional modeling of scattered data points
- A stochastic adaptive radial basis function algorithm for costly black-box optimization
- Information storage and search complexity theory
- Fuzzy-rough nearest neighbor algorithms in classification
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- A conversation with Jerry Friedman
- Nearest neighbors methods for support vector machines
- Example-based single document image super-resolution: a global MAP approach with outlier rejection
- A symmetry based multiobjective clustering technique for automatic evolution of clusters
- Rotation-discriminating template matching based on Fourier coefficients of radial projections with robustness to scaling and partial occlusion
- Computational approximations of compact metric spaces
- Using chaos to generate variations on movement sequences
- When are swing options bang-bang?
- Dimensionality reduction of collective motion by principal manifolds
- Numerical quadrature over the surface of a sphere
- Parallel algorithms for nearest neighbor search problems in high dimensions
- A localized meshless approach for modeling spatial-temporal calcium dynamics in ventricular myocytes
- Confidence regions for means of random sets using oriented distance functions
- Optimal Delaunay and Voronoi quantization schemes for pricing American style options
- Local 2D pattern spectra as connected region descriptors
- How to speed up the quantization tree algorithm with an application to swing options
- The structure-from-motion reconstruction pipeline -- a survey with focus on short image sequences
- Detecting phase transitions in collective behavior using manifold's curvature
- Optimal Quantization for the Pricing of Swing Options
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- Efficient learning and feature selection in high-dimensional regression
- WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION
- Neighborhood Property–Based Pattern Selection for Support Vector Machines
- Globally enumerating unstable periodic orbits for observed data using symbolic dynamics
- A computational approach for hypersonic nonequilibrium radiation utilizing space partition algorithm and Gauss quadrature
- Entropy-based block processing for satellite image registration
- Bayesian Modeling and Classification of Neural Signals
- Decomposable algorithms for nearest neighbor computing
- Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering
- Constructing a high-dimensional kNN-graph using a Z-order curve
- Learning Binary Hash Codes for Large-Scale Image Search
- Dual‐tree fast exact max‐kernel search
- An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification
- d-blink: Distributed End-to-End Bayesian Entity Resolution
- Cryo-EM reconstruction of continuous heterogeneity by Laplacian spectral volumes
- Simplicial Multivalued Maps and the Witness Complex for Dynamical Analysis of Time Series
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- A STATE‐SPACE PARTITIONING METHOD FOR PRICING HIGH‐DIMENSIONAL AMERICAN‐STYLE OPTIONS
- A Method for Measuring Distance From a Training Data Set
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- C^ compactly supported and positive definite radial kernels
- Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids
- Introduction to vector quantization and its applications for numerics
- UniversalLs-rate-optimality ofLr-optimal quantizers by dilatation and contraction
- A fast nearest neighbor search algorithm by filtration
- An optimal-transport finite-particle method for mass diffusion
This page was built for publication: An Algorithm for Finding Best Matches in Logarithmic Expected Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139672)
