Pages that link to "Item:Q3158524"
From MaRDI portal
The following pages link to An optimal algorithm for approximate nearest neighbor searching fixed dimensions (Q3158524):
Displaying 50 items.
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information (Q1795024) (← links)
- Analysis of an adaptive algorithm to find the two nearest neighbors (Q1840513) (← links)
- Dense neighborhoods on affinity graph (Q1931579) (← links)
- Low-interference networks in metric spaces of bounded doubling dimension (Q1944217) (← links)
- Image classification based on quantum K-nearest-neighbor algorithm (Q1991017) (← links)
- Efficient computation of partition of unity interpolants through a block-based searching technique (Q2007296) (← links)
- Adaptive radial basis function partition of unity interpolation: a bivariate algorithm for unstructured data (Q2023706) (← links)
- Extreme value theory for anomaly detection -- the GPD classifier (Q2027086) (← links)
- Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations (Q2068355) (← links)
- Kaldor-Kalecki new model on business cycles (Q2097863) (← links)
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds (Q2111184) (← links)
- IGA-suitable planar parameterization with patch structure simplification of closed-form polysquare (Q2138711) (← links)
- TSS: temporal similarity search measure for heterogeneous information networks (Q2159134) (← links)
- GPU accelerated initialization of local maximum-entropy meshfree methods for vibrational and acoustic problems (Q2184473) (← links)
- Fast-Match: fast affine template matching (Q2187432) (← links)
- Counts-of-counts similarity for prediction and search in relational data (Q2218368) (← links)
- A discrete mathematical model for chaotic dynamics in economics: Kaldor's model on business cycle (Q2228801) (← links)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767) (← links)
- Efficient data structures for model-free data-driven computational mechanics (Q2237265) (← links)
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case (Q2248735) (← links)
- Discretizing Laplace-Beltrami operator from differential quantities (Q2254355) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- Finding representative landmarks of data on manifolds (Q2270693) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme (Q2287568) (← links)
- Maximum-likelihood approximate nearest neighbor method in real-time image recognition (Q2289612) (← links)
- Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes (Q2290336) (← links)
- Monte Carlo simulation of radiative transfer in a medium with varying refractive index specified at discrete points (Q2293914) (← links)
- An efficient trivariate algorithm for tetrahedral Shepard interpolation (Q2302406) (← links)
- Spatiotemporal pattern extraction by spectral analysis of vector-valued observables (Q2327837) (← links)
- An immersed boundary method coupled with a dynamic overlapping-grids strategy (Q2331854) (← links)
- A numerical algorithm for multidimensional modeling of scattered data points (Q2342887) (← links)
- Randomized partition trees for nearest neighbor search (Q2345949) (← links)
- Nonlocal PDEs on graphs: from tug-of-war games to unified interpolation on images and point clouds (Q2360838) (← links)
- Optimizing the geometrical accuracy of curvilinear meshes (Q2375013) (← links)
- A stabilized finite element method using a discontinuous level set approach for the computation of bubble dynamics (Q2381184) (← links)
- Partition of unity interpolation using stable kernel-based techniques (Q2400786) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Virtuaschlieren: a hybrid GPU/CPU-based schlieren simulator for ideal and non-ideal compressible-fluid flows (Q2422954) (← links)
- Fast computation of triangular Shepard interpolants (Q2423565) (← links)
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions (Q2459569) (← links)
- Scalable representation for 3D object recognition using feature sharing and view clustering (Q2459582) (← links)
- Transient adaptivity applied to two-phase incompressible flows (Q2476865) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
- A quadrature-free discontinuous Galerkin method for the level set equation (Q2576308) (← links)
- Robust multi-view feature matching from multiple unordered views (Q2643895) (← links)
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256) (← links)
