The following pages link to (Q4542551):
Displaying 7 items.
- d-k-min-wise independent family of hash functions (Q340570) (← links)
- Identifying frequent items in distributed data sets (Q488300) (← links)
- Approximate joins for XML at label level (Q507755) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Exponential time improvement for min-wise based algorithms (Q716331) (← links)
- Min-wise independent permutations (Q1577016) (← links)
