Pages that link to "Item:Q3581521"
From MaRDI portal
The following pages link to Efficient algorithms for substring near neighbor problem (Q3581521):
Displayed 14 items.
- A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data (Q2237269) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
- (Q4558494) (← links)
- (Q4638108) (← links)
- The Distortion of Locality Sensitive Hashing (Q4638109) (← links)
- Learning Binary Hash Codes for Large-Scale Image Search (Q4649217) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- (Q5075744) (← links)
- (Q5115825) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- (Q5743459) (← links)