The following pages link to (Q4829005):
Displaying 15 items.
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices (Q629700) (← links)
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
- Entropy dimension reduction method for randomized machine learning problems (Q1717049) (← links)
- Deterministic discrepancy minimization (Q2017871) (← links)
- Feasibility of DEIM for retrieving the initial field via dimensionality reduction (Q2120024) (← links)
- A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- Using Randomization to Break the Curse of Dimensionality (Q4340685) (← links)
- A New Approach to Dimensionality Reduction: Theory and Algorithms (Q4507276) (← links)
- (Q4637072) (← links)
- An elementary proof of a theorem of Johnson and Lindenstrauss (Q4798181) (← links)
- (Q5457375) (← links)
- Holographic phenomenology via overlapping degrees of freedom (Q6603940) (← links)
