-
-
elsisds-document.rar
... candidate generation) and groups of candidates are tested against the data. The algorithm terminates when no further successful extensions are found. Apriori uses breadth-first search and a hash tree structure to count candidate item sets efficiently.
-
-
-
-
-
-
SIFTflow.zip
... object and its location, scale, and orientation in the new image are identified to filter out good matches. The determination of consistent clusters is performed rapidly by using an efficient hash table implementation of the generalized Hough transform.
-
word.rar
word加解密，适用于RC4、MD5、hash等一系列加密形式
-
md5.rar
md5 code.hash
input=text file
output=text file
function:md5 hashing
-
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
