Pages that link to "Item:Q5495807"
From MaRDI portal
The following pages link to Bottom-k and priority sampling, set similarity and subset sums with minimal independence (Q5495807):
Displaying 8 items.
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- d-k-min-wise independent family of hash functions (Q340570) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Exponential time improvement for min-wise based algorithms (Q716331) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- (Q5136262) (← links)
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum (Q5144983) (← links)