Search - hashing

[Books] Silbershatz-Database System Concetps ch12-Indexing and hashing

Description: Silbershatz-Database System Concetps ch12-Indexing and hashing.PDF
Platform: | Size: 728120 | Author: china_rmb@sohu.com | Hits:

[Crack Hack] HASHES.ZIP

Description: 雜湊法(Hashing)的搜尋與一般的搜尋法(searching)是不一樣的。在雜湊法中，鍵值(key value)或識別字(identifier)在記憶體的位址是經由函數(function)轉換而得的。此種函數，一般稱之為雜湊函數(Hashing function)或鍵值對應位址轉換(key to address transformation)。對於有限的儲存空間，能夠有效使用且在加入或刪除時也能快的完成，利用雜湊法是最適當不過了。因為雜湊表搜尋在沒有碰撞(collision)及溢位(overflow)的情況下，只要一次就可擷取到。 -hash (Hashing) search and search for a general law (searching) is not the same. The hash law, the pair (key value) or identification characters (identifier) in the memory address of the sender is by function (function) generated from the conversion. Such functions, commonly known as hash functions (Hashing function) keys corresponding addresses or conversion (key to address transformation). For the limited storage space, which can be effectively used in acceding to or deleted can be completed faster, using hash method is the most appropriate. Because hash table search in the absence of collisions (collision) and overflow (overflow) circumstances, as long as one can capture that.
Platform: | Size: 24576 | Author: HCJ | Hits:

[CA auth] Hash

Description: 雜湊法(Hashing)的搜尋與一般的搜尋法(searching)是不一樣的。在雜湊法中，鍵值(key value)或識別字(identifier)在記憶體的位址是經由函數(function)轉換而得的。此種函數，一般稱之為雜湊函數(Hashing function)或鍵值對應位址轉換(key to address transformation)。對於有限的儲存空間，能夠有效使用且在加入或刪除時也能快的完成，利用雜湊法是最適當不過了。因為雜湊表搜尋在沒有碰撞(collision)及溢位(overflow)的情況下，只要一次就可擷取到。-Hash method (Hashing) search and general search method (searching) is not the same. In the hash law, the key (key value) or identifier (identifier) address in memory by the function (function) derived from the conversion. Such a function, commonly known as hash function (Hashing function) or key corresponds to the address converter (key to address transformation). For a limited storage space, can be used effectively and in time to add or delete can be completed faster, the use of hash is the most appropriate of all. Because the hash table search in the absence of a collision (collision) and overflow (overflow) circumstances, as long as one can be retrieved.
Platform: | Size: 35840 | Author: 張建良 | Hits:

[Industry research] Image-Hashing-based-on-Human-Visual-System

Description: 提出一种基于视觉特性的图像摘要算法，增大人眼敏感的频域系数在计算图像Hash时的权重，使得图像Hash更好地体现视觉特征，并提高鲁棒性。将原始图像的分块DCT系数乘以若干由密钥控制生成的伪随机矩阵，再对计算的结果进行基于分块的Watson人眼视觉特性处理，最后进行量化判决产生固定长度的图像Hash序列。本算法比未采用视觉特性的算法相比，提高了对JPEG压缩和高斯滤波的鲁棒性。图像摘要序列由密钥控制生成，具有安全性。-Based on the visual characteristics of the image digest algorithm, increasing the human eye-sensitive frequency-domain coefficients in the calculation of the image when the weight of Hash, Hash makes images better reflect the visual characteristics, and improve robustness. Will block the original image multiplied by the number of DCT coefficients generated by the key control of pseudo-random matrix, then the results of calculation based on the sub-block of Watson HVS treatment, and finally quantify the judgments arising from fixed-length sequence of images Hash . Than the algorithm did not use the visual characteristics of the algorithm, improve the JPEG compression and Gaussian filtering robustness. Abstract image sequence generated by the key control, with security.
Platform: | Size: 167936 | Author: kurt | Hits:

[source in ebook] Hash

Description: 1. 本程序是针对我们班级中“人名”设计的哈希表，平均查找长度不超过R。 2. 程序中人名为汉语拼音形式，共30个我周围较熟悉的同学，取平均查找长度的上限为2.哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 3. 人名的长度均不超过19个字符，测试数据为查找“hanbiao”。本程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”之后，由用户在键盘上输入程序中规定的运算命令；相应的输入数据（滤去输入中的非法字符）和运算结果显示在其后。 -1. This procedure is for our classes, name designed hash table, the average length of no more than to find R. 2. Procedure human form known as Hanyu Pinyin, a total of 30 around me who are more familiar with the students, taking the average to find the length of the upper limit of 2. Hash function used in addition to stay more than a few law structure, with pseudo-random hashing method to detect and then deal with the conflict. 3. The names of persons not of the length of more than 19 characters, the test data to find hanbiao . The procedures to users and the computer implementation of dialogue, that is displayed on computer terminals in the message after, by the user at the keyboard, enter the procedure provided for computing the order corresponding input data (least squares input of illegal characters) and The results showed that in subsequent operations.
Platform: | Size: 198656 | Author: ck | Hits:

[Other] hash

Description: Hashing is a technique that allows insertions, deletions and searches of records according to keys in constant average time. In this tutorial, we will construct a hash table and implement its operations.-Hashing is a technique that allows insertions, deletions and searches of recordsaccording to keys in constant average time. In this tutorial, we will construct a hashtable and implement its operations.
Platform: | Size: 1024 | Author: jovi | Hits:

[Data structs] 45678900000000000

Description: 假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。-The assumption that the names of people known as China s Hanyu Pinyin form. Hash table to be populated with the names of a total of 30, taking the average to find the length of the upper limit of 2. Hash function used to stay more than a few laws in addition to construction, using pseudo-random hashing method to detect and then deal with the conflict.
Platform: | Size: 2048 | Author: yintao | Hits:

[Crack Hack] binaryextract

Description: 二值图像的信息隐藏，用到md5加密和改进后的置乱算法-Binary Image Information Hiding, use md5 encryption and improved hashing algorithm
Platform: | Size: 1024 | Author: guaiguai | Hits:

[assembly language] 115157707arnoldcipher

Description: 本程序介绍猫脸图象置乱算法，主要用于水印图象。-Introduction This procedure cat face image hashing algorithm, mainly for watermark image.
Platform: | Size: 1024 | Author: 李晨 | Hits:

[Other] CpulspulsLectureNotes2

Description: 輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) Recursion,Linked Lists, 4) Stacks and Queues, 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing 18) Pattern Matching 19) Additional Review -Easily learn C++ Programming skills- Jin Kai (Hong Kong University of Science and Technology Division notes 19) will include 1) base C++ Review, 2) Pointers and Dynamic Objects, 3) Recursion, Linked Lists, 4) Stacks and Queues , 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing18) Pattern Matching 19) Additional Review
Platform: | Size: 3751936 | Author: chan kindfish | Hits:

[Data structs] DS-41

Description: A C++ Program to show an example of Hashing using Mid-Square Method. 应用Mid-Square理论的哈希算法-A C++ Program to show an example of Hashing using Mid-Square Method. Application of Mid-Square Hash Algorithm Theory
Platform: | Size: 1024 | Author: 李丽 | Hits:

[Data structs] HXBSZ

Description: 1、设每个记录有下列数据项：电话号码、用户名、地址； 2、从键盘输入各记录，分别以电话号码和用户名为关键字建立哈希表； 3、采用再哈希法解决冲突； 4、查找并显示给定电话号码的记录； 5、查找并显示给定用户名的记录。 6、在哈希函数确定的前提下，尝试各种不同类型处理冲突的方法（至少两种），考察平均查找长度的变化。 -1, for each record the following data items: telephone numbers, user name, address 2, from the keyboard input of the records, respectively, telephone number and user name to establish Hashtable keywords 3, re-hashing method used to solve conflict 4, find and display a given telephone number of record 5, find and display a given user name records. 6, in the hash function to determine, under the premise of trying to deal with different types of conflict (at least two), visit Find the length of the average change.
Platform: | Size: 35840 | Author: 迟浩东 | Hits:

[Data structs] datrie_cvs20061001.tar

Description: This an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.-This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
Platform: | Size: 34816 | Author: lucoy | Hits:

[Software Engineering] cuckoo-undergrad.pdf

Description: A detailed expanation about the new Cuckoo hashing algorithm.
Platform: | Size: 144384 | Author: methy | Hits:

[Algorithm] hashing__

Description: program which uses hashing techniques for storing and retrieving the data. Input to the program: Some random numbers. Input will be from a file. Output: First the program reads all the input and store it properly using some hash techniques. Once your program reads the complete input,it waits for the user input (prompt to the user). User now enters some number.program displays if this number exists in the list or not. it also display the time taken in the search operation.
Platform: | Size: 7168 | Author: Abhiram | Hits:

[Graph program] e2lsh

Description: Nearest Neighbor Methods in Learning and Vision: Theory and Practice书中章节Locality-Sensitive Hashing Scheme Based on p-Stable Distributions 中LSH-Local Sensitive Hashing算法的C语言在Red Linux下实现-Book <Nearest Neighbor Methods in Learning and Vision: Theory and Practice> Chapter- Locality-Sensitive Hashing Scheme Based on p-Stable Distributions in the LSH-Local Sensitive Hashing- Algorithm in the C language under the Red Linux platform
Platform: | Size: 580608 | Author: 桑基韬 | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list