Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
Saturday, February 19, 2011
Sets intersection, union, membership
Given a set S1 and set S2 how can you estimate the intersection, the union, and the existence of at least one element in common. Assume that S1 is very large AND/OR S2 is also very large that they cannot fit in memory and you accept to have an approximate solution.