The following pages link to (Q3140435):
Displayed 33 items.
- Detecting phase transitions in collective behavior using manifold's curvature (Q335289) (← links)
- Multilabel classification with meta-level features in a learning-to-rank framework (Q439034) (← links)
- Pivot selection: dimension reduction for distance-based indexing (Q450522) (← links)
- An indexing-based approach to pattern and video clip recognition (Q891483) (← links)
- A scalable re-ranking method for content-based image retrieval (Q903669) (← links)
- Parallel query processing on distributed clustering indexes (Q1013068) (← links)
- Solving similarity joins and range queries in metric spaces with the list of twin clusters (Q1013069) (← links)
- Counting distance permutations (Q1013072) (← links)
- Exploiting distance coherence to speed up range queries in metric indexes (Q1041769) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- A parallel computing framework for big data (Q1712556) (← links)
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information (Q1795024) (← links)
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
- Transforming Tanimoto queries on real valued vectors to range queries in Euclidean space (Q1959295) (← links)
- Monomial augmentation guidelines for RBF-FD from accuracy versus computational time perspective (Q1996005) (← links)
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances (Q2001629) (← links)
- ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
- Probabilistic analysis of vantage point trees (Q2068978) (← links)
- Fast neighbor search by using revised \(k\)-d tree (Q2200699) (← 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)
- Fusing vantage point trees and linear discriminants for fast feature classification (Q2359576) (← links)
- Balanced compact clustering for efficient range queries in metric spaces (Q2449057) (← links)
- Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths (Q2670886) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- A distributed kernel summation framework for general‐dimension machine learning (Q4969920) (← links)
- Dual‐tree fast exact max‐kernel search (Q4969941) (← links)
- (Q5075744) (← links)
- Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers (Q5448646) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
- Efficient image retrieval through vantage objects (Q5952756) (← links)
- Guidelines for RBF-FD discretization: numerical experiments on the interplay of a multitude of parameter choices (Q6159293) (← links)