The following pages link to FLANN (Q27201):
Displaying 31 items.
- Assessment and improvement of mapping algorithms for non-matching meshes and geometries in computational FSI (Q296040) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Tri-partition neighborhood covering reduction for robust classification (Q518636) (← links)
- Arthritic hand-finger movement similarity measurements: tolerance near set approach (Q541198) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Index structures for fast similarity search for real vectors. II (Q722065) (← links)
- Improved maximum inner product search with better theoretical guarantee using randomized partition trees (Q1621880) (← links)
- Tuning of the hyperparameters for \(L2\)-loss SVMs with the RBF kernel by the maximum-margin principle and the jackknife technique (Q1669630) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- FANCFIS: fast adaptive neuro-complex fuzzy inference system (Q1726368) (← links)
- 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)
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
- Quick-means: accelerating inference for K-means by learning fast transforms (Q2051290) (← links)
- Random clustering forest for extended belief rule-based system (Q2099900) (← links)
- Fast-Match: fast affine template matching (Q2187432) (← links)
- Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data (Q2200557) (← links)
- Fast neighbor search by using revised \(k\)-d tree (Q2200699) (← links)
- A model-free Bayesian classifier (Q2212071) (← links)
- Counts-of-counts similarity for prediction and search in relational data (Q2218368) (← links)
- Efficient data structures for model-free data-driven computational mechanics (Q2237265) (← links)
- A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data (Q2237269) (← links)
- Model-free data-driven methods in mechanics: material data identification and solvers (Q2319394) (← links)
- Anisotropic and feature sensitive triangular remeshing using normal lifting (Q2352309) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension (Q2424630) (← links)
- Model-free data-driven inference in computational mechanics (Q2679455) (← links)
- Model-free and prior-free data-driven inference in mechanics (Q2679811) (← links)
- Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions (Q2830635) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
- Properties of the turbulent/non-turbulent interface in boundary layers (Q4976780) (← links)
