Pages that link to "Item:Q5361678"
From MaRDI portal
The following pages link to Locality-sensitive hashing scheme based on p-stable distributions (Q5361678):
Displaying 50 items.
- Propagation kernels: efficient graph kernels from propagated information (Q298353) (← links)
- An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud (Q355501) (← links)
- Consensus hashing (Q747259) (← links)
- Explicit embeddings for nearest neighbor search with Mercer kernels (Q890103) (← links)
- Multiple feature kernel hashing for large-scale visual search (Q898328) (← links)
- Investigation of accelerated search for close text sequences with the help of vector representations (Q1007160) (← links)
- Improved maximum inner product search with better theoretical guarantee using randomized partition trees (Q1621880) (← links)
- Classification tree methods for panel data using wavelet-transformed time series (Q1663123) (← links)
- Scalable density-based clustering with quality guarantees using random projections (Q1741164) (← links)
- Why locality sensitive hashing works: a practical perspective (Q1751421) (← links)
- Fast, linear time, \(m\)-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement (Q1760308) (← links)
- Global similarity preserving hashing (Q1797823) (← links)
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions (Q2023176) (← links)
- Random projection-based auxiliary information can improve tree-based nearest neighbor search (Q2055550) (← links)
- Unified binary generative adversarial network for image retrieval and compression (Q2056141) (← links)
- Hadamard matrix guided online hashing (Q2056146) (← links)
- Anchor-based self-ensembling for semi-supervised deep pairwise hashing (Q2056149) (← links)
- Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation (Q2127042) (← links)
- Federated personalized random forest for human activity recognition (Q2130143) (← links)
- Locality sensitive hashing with extended differential privacy (Q2148769) (← links)
- A comparative study of data-dependent approaches without learning in measuring similarities of data objects (Q2218403) (← links)
- Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data (Q2228285) (← links)
- SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search (Q2275987) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- A reusable and single-interactive model for secure approximate \(k\)-nearest neighbor query in cloud (Q2293034) (← links)
- Heterogeneous distributed big data clustering on sparse grids (Q2312425) (← links)
- Sharing hash codes for multiple purposes (Q2329853) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- I/O-efficient similarity join (Q2408174) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Vector representations for efficient comparison and search for similar strings (Q2480497) (← links)
- Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
- Locality-Sensitive Hashing Without False Negatives for $$l_p$$ (Q2817854) (← links)
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- I/O-Efficient Similarity Join (Q3452853) (← links)
- Representation and coding of signal geometry (Q4603712) (← links)
- Time for dithering: fast and quantized random embeddings via the restricted isometry property (Q4603715) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- (Q4638108) (← links)
- Learning Binary Hash Codes for Large-Scale Image Search (Q4649217) (← links)
- Privacy Preserving Query over Encrypted Multidimensional Massive Data in Cloud Storage (Q4690886) (← links)
- A general framework for efficient clustering of large datasets based on activity detection (Q4969747) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique (Q5025039) (← links)
- Habituation as a neural algorithm for online odor discrimination (Q5073072) (← links)
- (Q5115825) (← links)
