The following pages link to (Q4542551):
Displaying 19 items.
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- 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)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- Generalized substring selectivity estimation (Q1394798) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- SONIC: streaming overlapping community detection (Q1741254) (← links)
- Variance reduction in feature hashing using MLE and control variate method (Q2102328) (← links)
- Efficient binary embedding of categorical data using BinSketch (Q2134033) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- On b-bit min-wise hashing for large-scale regression and classification with sparse data (Q4558503) (← links)
- (Q4941822) (← links)
- Analysis of Min-Hashing for Variant Tolerant DNA Read Mapping (Q5111827) (← links)
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data (Q5135244) (← links)
