swMATH9854MaRDI QIDQ21833FDOQ21833
Author name not available (Why is that?)
Official website: http://www.cs.umd.edu/~mount/ANN/
Cited In (54)
- HALTON
- A numerical algorithm for multidimensional modeling of scattered data points
- The Monge-Ampère-Kantorovich approach to reconstruction in cosmology
- Practical methods for shape fitting and kinetic data structures using coresets
- Rapid and effective segmentation of 3D models using random walks
- Surface reconstruction by parallel and unified particle-based resampling from point clouds
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- Parallel and adaptive surface reconstruction based on implicit PHT-splines
- Title not available (Why is that?)
- Texture synthesis via the matching compatibility between patches
- A local least-squares method for solving nonlinear partial differential equations of second order
- Efficient and robust persistent homology for measures
- A logarithmic-time solution to the point location problem for parametric linear programming
- Toward approximate moving least squares approximation with irregularly spaced centers
- Title not available (Why is that?)
- A contact dynamics approach to the granular element method
- Slope failure probability at critical value of safety factor
- QSHEP3D
- yaImpute
- Experiments in navigation and mapping with a hovering AUV
- Neighborhood density information in clustering
- Flood
- MLPACK
- 3D Alpha Shapes
- SPMF
- FLANN
- STANN
- E2LSH
- HykSort
- LeSiNN
- Vinci
- SimPers
- RANN
- msr
- SimBa
- NodeLab
- LMGC90
- V-Clip
- Efficient neighbor search for particle methods on GPUs
- An object-oriented environment for developing finite element codes for multi-disciplinary applications
- Parallel algorithms for nearest neighbor search problems in high dimensions
- Nonlinear manifold learning for meshfree finite deformation thin-shell analysis
- GAPS: A clustering method using a new point symmetry-based distance measure
- A weighted \(k\)-nearest neighbor density estimate for geometric inference
- Medusa
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch-collapse
- Implementation techniques for geometric branch-and-bound matching methods
- Arbitrage-free approximation of call price surfaces and input data risk
- Improved implementation of point location in general two-dimensional subdivisions
- Efficient random-walk methods for approximating polytope volume
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
- A symmetry based multiobjective clustering technique for automatic evolution of clusters
- Improved radial basis function fluid-structure coupling via efficient localized implementation
- An information theoretic approach to use high-fidelity codes to calibrate low-fidelity codes
This page was built for software: ANN
