Skip to search formSkip to main contentSkip to account menu

MinHash

Known as: Min-wise independence 
In computer science, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Commercial web pages contain several blocks of information. Apart from the core content blocks, there exist subsidiary blocks… 
2017
2017
. In this paper, we propose a scalable kernel for nodes in a (huge) graph. In contrast with other state-of-the-art kernels that… 
2017
2017
We propose a highly efficient and effective algorithm to estimate metrics on very large graphs that are based on the neighborhood… 
2015
2015
In many image retrieval systems, re-ranking is an important final step to improve the retrieval accuracy given an initial ranking… 
2014
2014
In this paper, we will enlist the process of extracting template from heterogeneous Web Pages. Extracting structured information… 
2014
2014
In this paper, we consider the problem of securing mobile-cloud storage services. We design and develop a novel and secure… 
2012
2012
Image graph attracts attention from researchers due to the empirical success of graph based semi-supervised learning (SSL… 
2000
2000
SUMMARY A family C of min-wise independent permutations is known to be a useful tool of indexing replicated documents on the Web… 
1999
1999
Session Random 1.- Completeness and Robustness Properties of Min-Wise Independent Permutations.- Low Discrepancy Sets Yield…