The following pages link to Min-wise independent permutations (Q1577016):
Displaying 38 items.
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices (Q418346) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Optimality in external memory hashing (Q1006387) (← links)
- Sketching information divergences (Q1009269) (← links)
- Min-wise independent groups (Q1413231) (← links)
- Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Improving MinHash via the containment index with applications to metagenomic analysis (Q2011091) (← links)
- Anchor-based self-ensembling for semi-supervised deep pairwise hashing (Q2056149) (← links)
- Train tracks with gaps: applying the probabilistic method to trains (Q2062121) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- Locality sensitive hashing with extended differential privacy (Q2148769) (← links)
- Incremental design-space model checking via reusable reachable state approximations (Q2149964) (← links)
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams (Q2218366) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- On the minimum number of completely 3-scrambling permutations (Q2476274) (← links)
- Growth of the perfect sequence covering array number (Q2697491) (← links)
- Frequent-Itemset Mining Using Locality-Sensitive Hashing (Q2817857) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations (Q3225464) (← links)
- Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844) (← links)
- Perturbed Identity Matrices Have High Rank: Proof and Applications (Q3557502) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← links)
- The Distortion of Locality Sensitive Hashing (Q4638109) (← links)
- MULTIPLE TRANSITIVITY AND MIN-WISE INDEPENDENCE IN PERMUTATION GROUPS (Q4662060) (← links)
- (Q4761355) (← links)
- Min-Wise Independent Families with Respect to any Linear Order (Q5426290) (← links)
- Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms (Q5458312) (← links)
- (Q5743459) (← links)
- (Q5857609) (← links)
