FLANN

swMATH15312MaRDI QIDQ27201FDOQ27201

Author name not available (Why is that?)

Official website: http://www.cs.ubc.ca/research/flann/

Cited In (41)

• A model-free Bayesian classifier
• Random clustering forest for extended belief rule-based system
• Counts-of-counts similarity for prediction and search in relational data
• MAP123-EPF
• Arthritic hand-finger movement similarity measurements: tolerance near set approach
• Distance-based index structures for fast similarity search
• Fast neighbor search by using revised \(k\)-d tree
• Improved maximum inner product search with better theoretical guarantee using randomized partition trees
• Index structures for fast similarity search for real vectors. II
• Fast-Match: fast affine template matching
• Approximating spectral clustering via sampling: a review
• Binary vectors for fast distance and similarity estimation
• Assessment and improvement of mapping algorithms for non-matching meshes and geometries in computational FSI
• Anisotropic and feature sensitive triangular remeshing using normal lifting
• Generalised kernel weighted fuzzy c-means clustering algorithm with local information
• Graph interpolating activation improves both natural and robust accuracies in data-efficient deep learning
• Model-free data-driven methods in mechanics: material data identification and solvers
• FANCFIS: fast adaptive neuro-complex fuzzy inference system
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Index structures for fast similarity search for real-valued vectors. I
• Megaman
• Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
• Tuning of the hyperparameters for \(L2\)-loss SVMs with the RBF kernel by the maximum-margin principle and the jackknife technique
• LeSiNN
• Algorithm 964
• FALCONN
• Index structures for fast similarity search for binary vectors
• 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
• NMSLIB
• Parallel algorithms for nearest neighbor search problems in high dimensions
• Model-free and prior-free data-driven inference in mechanics
• Model-free data-driven inference in computational mechanics
• Properties of the turbulent/non-turbulent interface in boundary layers
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Tri-partition neighborhood covering reduction for robust classification
• A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data
• Efficient data structures for model-free data-driven computational mechanics
• Title not available (Why is that?)
• Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data
• Efficient random-walk methods for approximating polytope volume

This page was built for software: FLANN