The following pages link to (Q4542583):
Displaying 50 items.
- Similarity, kernels, and the fundamental constraints on cognition (Q256393) (← links)
- Similarity based deduplication with small data chunks (Q313748) (← links)
- Coding of image feature descriptors for distributed rate-efficient visual correspondences (Q409091) (← links)
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis (Q418747) (← links)
- Decomposable algorithms for nearest neighbor computing (Q436812) (← links)
- Compressed labeling on distilled labelsets for multi-label learning (Q439035) (← links)
- Indexability, concentration, and VC theory (Q450514) (← links)
- Nonparametric link prediction in large scale dynamic networks (Q470494) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Dimensionality reduction with subgaussian matrices: a unified theory (Q515989) (← links)
- Two-dimensional random projection (Q537260) (← links)
- On the distance concentration awareness of certain data reduction techniques (Q614077) (← links)
- Iterative denoising (Q626230) (← links)
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices (Q629700) (← links)
- Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma (Q639988) (← links)
- Improved linear embeddings via Lagrange duality (Q669310) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries (Q728770) (← links)
- Consensus hashing (Q747259) (← links)
- Faster compression methods for a weighted graph using locality sensitive hashing (Q780991) (← links)
- Sampling hyperspheres via extreme value theory: implications for measuring attractor dimensions (Q781846) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Kernels as features: on kernels, margins, and low-dimensional mappings (Q851869) (← links)
- Vector data transformation using random binary matrices (Q891113) (← links)
- Multiple feature kernel hashing for large-scale visual search (Q898328) (← links)
- Set-based approximate approach for lossless graph summarization (Q904121) (← links)
- Probably correct \(k\)-nearest neighbor search in high dimensions (Q962679) (← links)
- Viewpoint independent object recognition in cluttered scenes exploiting ray-triangle intersection and SIFT algorithms (Q991271) (← links)
- Nearest neighbour group-based classification (Q991960) (← links)
- Investigation of accelerated search for close text sequences with the help of vector representations (Q1007160) (← links)
- A simple proof of the restricted isometry property for random matrices (Q1039884) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Improved maximum inner product search with better theoretical guarantee using randomized partition trees (Q1621880) (← links)
- Unique entity estimation with application to the Syrian conflict (Q1624822) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Robust proximity search for balls using sublinear space (Q1702130) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- SONIC: streaming overlapping community detection (Q1741254) (← links)
- Multiple Bayesian discriminant functions for high-dimensional massive data classification (Q1741308) (← links)
- Why locality sensitive hashing works: a practical perspective (Q1751421) (← links)
- De-anonymization of heterogeneous random graphs in quasilinear time (Q1755750) (← links)
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering (Q1793461) (← links)
