Does there exist a hash of a set that won't reveal membership, but which preserves union and intersection operations? /cc @csoghoian
-
-
@avibryant@vagabondjack even something like Bloom would give you that. Intersects have more errors than membership though. -
@fdaapproved@vagabondjack right, which exactly of bloom/HLL/minhash/KMV etc you use is just about tuning the false+ve/-ve/cardinality err.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.