Home  - Sports - Hashing

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

61-74 of 74    Back | 1  | 2  | 3  | 4

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Hashing:     more books (72)

Robin Hood hashing (Research report. University of Waterloo. Department of Computer Science) by Pedro Celis, 1986 Relative prime transformation aids the minimal perfect hashing function by Celestina T Fung, 1986 Dynamic file organizations for partial match retrieval based on linear hashing (Technical report. University of Minnesota. Institute of Technology. Computer Science Dept) by T. S Yuen, 1985 A general purpose scatter storage subsystem and a comparison of hashing methods (SuDoc NAS 1.26:175814) by Steven C. Macy, 1984 Searching on alphanumeric keys using local balanced trie hashing (Technical report. Carleton University. School of Computer Science) by Ekow J Otoo, 1987 Security and Privacy in Digital Rights Management: ACM CCS-8 Workshop DRM 2001, Philadelphia, PA, USA, November 5, 2001. Revised Papers (Lecture Notes in Computer Science) String Processing and Information Retrieval: 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings (Lecture Notes ... Computer Science and General Issues) Cryptographic Libraries for Developers (Programming Series) by Ed Moyle, Diana Kelley, 2005-12-15 Graph-Based Representations in Pattern Recognition: 7th IAPR-TC-15 International Workshop, GbRPR 2009, Venice, Italy, May 26-28, 2009. Proceedings (Lecture ... Vision, Pattern Recognition, and Graphics) Unique file identification in the National Software Reference Library [An article from: Digital Investigation] by S. Mead, 2006-09-01 Accurate discovery of co-derivative documents via duplicate text detection [An article from: Information Systems] by Y. Bernstein, J. Zobel, 2006-11-01 Searching algorithms (Teubner-Texte zur Mathematik) by J Wiedermann, 1987 Using hash functions as a hedge against chosen ciphertext attack (Research report / International Business Machines Corporation. Research Division) by Victor Shoup, 1999 A lexical analogy to feature matching and pose estimation (SuDoc C 13.58:6790) by John Albert Horst, 2002

lists with details

61. Pittsburgh Hash House Harriers
    The unofficial Pittsburgh Hash House Harriers Home Page.  
    http://www.pgh-h3.com/
    
    Extractions: You have just stumbled upon an I nternational phenomenon, where a group of people, "Hashers" , follow a cryptic trail that has been marked with flour by the "Hare ". This trail leads to beer, water, snacks, and a lot of camaraderie. Some people run, some people walk, but they all follow these cryptic marks along streets, trails, and off the beaten path until they find a beer stop. Now there is water there too, and snacks, but really we are known as a Beer Drinking Club with a Running Problem

62. Tree Hash EXchange Format (THEX)
    This memo presents the Tree Hash Exchange (THEX) format, for exchanging Merkle Hash Trees built up from the subrange hashes of discrete digital files.  
    http://open-content.net/specs/draft-jchapweske-thex-02.html
    
    Extractions: Tree Hash EXchange format (THEX) This memo presents the Tree Hash Exchange (THEX) format, for exchanging Merkle Hash Trees built up from the subrange hashes of discrete digital files. Such tree hash data structures assist in file integrity verification, allowing arbitrary subranges of bytes to be verified before the entire file has been received. TOC The Merkle Hash Tree, invented by Ralph Merkle, is a hash construct that exhibits desirable properties for verifying the integrity of files and file subranges in an incremental or out-of-order fashion. This document describes a binary serialization format for hash trees that is compact and optimized for both sequential and random access. This memo has two goals: To describe Merkle Hash Trees and how they are used for file integrity verification.

63. Hash Function
    A Hash Function is a Unary Function that is used by Hashed Associative Containers it maps its argument to a result of type size_t. A Hash Function must be  
    http://www.sgi.com/tech/stl/HashFunction.html
    
    Extractions: Categories : containers, functors Component type : concept A Hash Function is a Unary Function that is used by Hashed Associative Containers : it maps its argument to a result of type . A Hash Function must be deterministic and stateless. That is, the return value must depend only on the argument, and equal arguments must yield equal results. The performance of a Hashed Associative Container depends crucially on its hash function. It is important for a Hash Function to minimize collisions, where a collision is defined as two different arguments that hash to the same value. It is also important that the distribution of hash values be uniform; that is, the probability that a Hash Function returns any particular value of type should be roughly the same as the probability that it returns any other value. Unary Function Result type The type returned when the Hash Function is called. The result type must be None, except for those described in the

64. Minneapolis Hash House Harriers: Hash Schedule
    Minneapolis, Minnesota Kennel of the Hash House Harriers.  
    http://www.minneapolish3.com/
    
    Extractions: MH961 Comments Rectal Page Spewation 2008 MH3 Info Dictionary Schedule Run Comments Photos Counter ... Future Events Discussion Forum Mail List Links Mismanagement Who's Who The Crew April Runs and Events Sun Mon Tue Wed Thu Fri Sat May Runs and Events Sun Mon Tue Wed Thu Fri Sat A1 Hash House Harriers (H3 Web Ring) Join Now Ring Hub Random This page screwed up by Crash Test Dummy Let Ctd know of problems or suggestions.

65. Cleveland Hash House Harriers And Harriettes
    The drinking club with a running problem.  
    http://www.clevelandhash.com/

66. Chicago Hash House Harriers
    The Chicago Hash House Harriers, drinking club with a running problem.  
    http://www.chicagohash.com/
    
    Extractions: Here’s a pic of the hash 2008 Shamrock Shuffle team and friends with our second annual "beer in a box" at the postparty. Click on the "pictures" link to view this or any other album. This is a preview of Read the full post (339 words, 5 images, estimated 1:21 mins reading time) Published by itstoosoft on March 24, 2008

67. Hash House Harrier Press Kit
    Please direct questions to ZiPpY, Official Hash House Harrier Bibliographer at zippy@harrier.net . Last update was at 0946 PM on Sunday, January 23, 2000.  
    http://harrier.net/presskit/
    
    Extractions: The Real Deal Premise Brief History Essential Definitions In Memory of "G" This press kit is provided as a public service of Harrier.Net . Please direct questions to ZiPpY, Official Hash House Harrier Bibliographer at zippy@harrier.net . Last update was at 09:46 PM on Sunday, January 23, 2000 Harrier.Net Home

68. Middle Georgia Hash House Harriers
    Middle Georgia s local crosscountry running club with a drinking problem! A great way to spice up your jogging, walking, or running routine.  
    http://mgh4.com/
    
    Extractions: Proudly contributing to the decline of civilization in Middle Georgia! 'DRINKING CLUB WITH A RUNNING PROBLEM'. Anyone who wants to have some fun, drink some beer, and get a bit of exercise, can put on their running shoes and meet us for the next trail. There is no formal membership and we LOVE new people to come out and join us!!!

69. SparkNotes: Hash Tables: What Is A Hash Table?
    A hash table is made up of two parts an array (the actual table where the data to be searched is stored) and a mapping function, known as a hash function.  
    http://www.sparknotes.com/cs/searching/hashtables/section1.html
    
    Extractions: saveBookmark("", "", ""); Shopping Cart Checkout Home Computer Science Study Guides ... Hash Tables : What is a Hash Table? - Navigate Here - Introduction and Summary Terms What is a Hash Table? Problems Hash Functions Problems Coding up a Hash Table Problems Another use of hashing: Rabin-Karp string searching Problems What is a Hash Table? As we saw with binary search , certain data structures such as a binary search tree can help improve the efficiency of searches. From linear search to binary search , we improved our search efficiency from O n to O logn . We now present a new data structure , called a hash table, that will increase our efficiency to O , or constant time A hash table is made up of two parts: an array (the actual table where the data to be searched is stored) and a mapping function, known as a hash function. The hash function is a mapping from the input space to the integer space that defines the indices of the array. In other words, the hash function provides a way for assigning numbers to the input data such that the data can then be stored at the array index corresponding to the assigned number. Let's take a simple example. First, we start with a hash table array of strings (we'll use strings as the data being stored and searched in this example). Let's say the hash table size is 12:

70. What Is The MD5 Hash?
    The MD5 hash also known as checksum for a file is a 128bit value, something like a fingerprint of the file. There is a very small possibility of getting  
    http://www.fastsum.com/support/md5-checksum-utility-faq/md5-hash.php
    
    Extractions: Frequently Asked Questions: Basic concepts The MD5 hash also known as checksum for a file is a 128-bit value, something like a fingerprint of the file. There is a very small possibility of getting two identical hashes of two different files. This feature can be useful both for comparing the files and their integrity control. Let us imagine a situation that will help to understand how the MD5 hash works. Alice and Bob have two similar huge files. How do we know that they are different without sending them to each other? We simply have to calculate the MD5 hashes of these files and compare them. Act now, and experience the MD5 hash checker utility for yourself, control your data! Download the MD5 hash checker now! You can learn how to use it from the Online Help or by visiting the main page The MD5 hash consists of a small amount of binary data, typically no more than 128 bits. All hash values share the following properties: Hash length The length of the hash value is determined by the type of the used algorithm, and its length does not depend on the size of the file. The most common hash value lengths are either 128 or 160 bits. Non-discoverability Every pair of nonidentical files will translate into a completely different hash value, even if the two files differ only by a single bit. Using today's technology, it is not possible to discover a pair of files that translate to the same hash value.

71. SANS Institute - Special Papers / Features / Interviews
    The SANS Institute, offering computer security training for system administrators, computer security professionals, and network administrators,  
    http://www.sans.org/reading_room/special/index.php?id=oracle_pass

72. Oregon Hash House Harriers
    History of the club, pictures, merchandise, recommended, upcoming events, and links to area clubs.  
    http://www.oregonhhh.org/

73. Jax Hash House Harriers
    Jax Beach Hash House Harriers A Drinking Club with a Running Problem Jax Hash 526 Sat, 03/15/2008 Hare(s) Capt Taco and Back Bedroom Bobber  
    http://www.jaxh3.com/

74. Howstuffworks "How Encryption Works"
    How secure is the Internet for sending sensitive information? Learn all about encryption, authentication, hash algorithms and more.  
    http://computer.howstuffworks.com/encryption2.htm
    
    Extractions: Inside This Article Introduction to How Encryption Works Encryption Systems Symmetric Key Public Key Public Key: SSL Hashing Algorithms Authentication ... articles In symmetric-key encryption , each computer has a secret key (code) that it can use to encrypt a packet of information before it is sent over the network to another computer. Symmetric-key requires that you know which computers will be talking to each other so you can install the key on each one. Symmetric-key encryption is essentially the same as a secret code that each of the two computers must know in order to decode the information. The code provides the key to decoding the message. Think of it like this: You create a coded message to send to a friend in which each letter is substituted with the letter that is two down from it in the alphabet. So "A" becomes "C," and "B" becomes "D". You have already told a trusted friend that the code is "Shift by 2". Your friend gets the message and decodes it. Anyone else who sees the message will see only nonsense.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

61-74 of 74    Back | 1  | 2  | 3  | 4