FLANN

swMATH15312MaRDI QIDQ27201

No author found.

Related Items (35)

Binary vectors for fast distance and similarity estimation ⋮ Improved maximum inner product search with better theoretical guarantee using randomized partition trees ⋮ Assessment and improvement of mapping algorithms for non-matching meshes and geometries in computational FSI ⋮ Unnamed Item ⋮ Tuning of the hyperparameters for \(L2\)-loss SVMs with the RBF kernel by the maximum-margin principle and the jackknife technique ⋮ Fast-Match: fast affine template matching ⋮ Model-free data-driven inference in computational mechanics ⋮ Model-free and prior-free data-driven inference in mechanics ⋮ Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension ⋮ Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data ⋮ Fast neighbor search by using revised \(k\)-d tree ⋮ Distance-based index structures for fast similarity search ⋮ A model-free Bayesian classifier ⋮ Counts-of-counts similarity for prediction and search in relational data ⋮ FANCFIS: fast adaptive neuro-complex fuzzy inference system ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Efficient Random-Walk Methods for Approximating Polytope Volume ⋮ 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 ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Index structures for fast similarity search for binary vectors ⋮ Tri-partition neighborhood covering reduction for robust classification ⋮ Arthritic hand-finger movement similarity measurements: tolerance near set approach ⋮ Index structures for fast similarity search for real vectors. II ⋮ Index-based, high-dimensional, cosine threshold querying with optimality guarantees ⋮ Generalised kernel weighted fuzzy c-means clustering algorithm with local information ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Quick-means: accelerating inference for K-means by learning fast transforms ⋮ Properties of the turbulent/non-turbulent interface in boundary layers ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ Model-free data-driven methods in mechanics: material data identification and solvers ⋮ Random clustering forest for extended belief rule-based system ⋮ Graph interpolating activation improves both natural and robust accuracies in data-efficient deep learning ⋮ Anisotropic and feature sensitive triangular remeshing using normal lifting

This page was built for software: FLANN