Geometry.Net - the online learning center
Home  - Sports - Hashing
e99.com Bookstore
  
Images 
Newsgroups
Page 3     41-60 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20
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)
  1. Internal hashing for dynamic and static tables by T. G Lewis, 1988
  2. Multilevel trie hashing (Rapports de recherche. Institut National de Recherche en Informatique et en Automatique) by W Litwin, 1987
  3. Latency-sensitive hashing for collaborative web caching (Research report RC. International Business Machines Corporation. Research Division) by Kun-Lung Wu, 2000
  4. Parallel hashing: An efficient implementation of shared memory (Research Report RJ. International Business Machines Corporation. Research Division) by Anna R Karlin, 1986
  5. Split sequence coalesced hashing (Technical report) by D Murthy, 1988
  6. Hashing-based traffic splitting algorithms for internet load balancing (GIT-CC) by Zhiruo Cao, 1999
  7. An experimental method of study for minimal perfect hashing function: Reciprocal hashing by Dusaneya Somsiri, 1987
  8. Analysis of some new variants of coalesced hashing (Techincal report / Brown University, Dept. of Computer Science) by Wen-Chin Chen, 1984
  9. Universal hashing in VLSI: (extended abstract) (Technical report. Pennsylvania State University. Dept. of Computer Science) by Martin Furer, 1987
  10. An extended study on ordered minimal perfect hashing scheme by Li-Pan Huang, 1986
  11. Deletion algorithms for coalesced hashing (Technical report / Brown University, Dept. of Computer Science) by Wen-Chin Chen, 1984
  12. An algorithm for garbage collecting in a hashing environment (Technical report - Indiana University, Computer Science Department) by Daniel P Friedman, 1976
  13. Hashing moving objects (Computer science technical report series CS-TR) by Zhexuan Song, 2000
  14. Hashing: Masters for making overhead slides (OSU-CS-TR) by George E Hedrick, 1995

41. Hashing - Computes MD5 Hash For Any File, Can Compare. Integrates In Send To And
MD5 hasher 1.6 Computes MD5 hash for any file, can compare it with given. Integrates in Send To and shell on demand. Unintegrates on demand. Drag-and-drop supported.
http://hashing.softalizer.com/
Search our site:
Hashing
MD5 hasher 1.6
Computes MD5 hash for any file, can compare it with given. Integrates in Send To and shell on demand. Un-integrates on demand. Drag-and-drop supported. Automatically looks for corresponding md5 file with hash to compare, and vise-versa. Large files supported. Progress indicator and cancellation. UNC (local network filenames) supported. Now with updates check support.
hash
hashing checksum EDCrypt 3.1
Softuarium EDCrypt is an ActiveX control performing following functions: - encrypts and decrypts text and files using symmetrical ciphers: BLOWFISH, CAST128, GOST, RC2, RIJNDAEL, TWOFISH - computes hashes (message digests) of text and files using hashing algorithms: ADLER32, CRC32, CRC32B, GOST, HAVAL128, HAVAL160, HAVAL192, HAVAL224, HAVAL256, MD2, MD4, MD5, RIPEMD128, RIPEMD160, SHA1, SHA256, SHA384, SHA512 - securely shreds files
encryption
decryption hashing message digest ... .NET Encryption Library 1.07
Affordable, powerful, and easy to use .NET Encryption/Hashing/Compression Library. Encrypt sensitive information such as passwords, credit cards and social security numbers. Supports Rijndael (AES), DES, TripleDES, RC2, Blowfish, Twofish, Whirlpool, MD2, MD4, MD5, SHA1, SHA2, HAVAL, GOST, Ripend320, FCS16, FCS32, CRC32, Adler32, X509, UUencode, Base64, GZip, and Deflate.
.net encryption
encryption library hashing compression ... CommuniCrypt QuickHasher 1.00

42. Hashing
hashing computer dictionary definition.
http://www.computerhope.com/jargon/h/hashing.htm
Hashing
  • When referring to databases, hashing is a method of sorting and indexing data. The idea behind hashing is to allow large amounts of data to be indexed using keywords or keys commonly created by complex formulas. Hashing allows for large amounts of information to be quickly searched and listed. When referring to security, hashing is a method of taking data, encrypting it, and creating unpredictable, irreversible output. There are many different types of hashing algorithms. MD2, MD5, SHA and SHA-1 are examples of hashing algorithms.
  • Also see: Algorithm

    43. Half-Mind Catalog
    Status . Released 14/1/2008 Introduction. Most of today’s applications use login/password in order to authenticate. Users often use the same login/password for different
    http://www.half-mind.com/Hashing/who.htm
    Half-Mind,com Catalog

    44. Singapore Bike Hash - Welcome!
    Mountain bike hashing in Singapore through different terrains.
    http://www.twa.com.sg/sbh/index.html

    45. News Headlines
    Oct 27, 2010 DUBLIN, Oct 27, 2010 (BUSINESS WIRE) Research and Markets (http//www.researchandmarkets.com/research/ceaa58/hashing_in_compute) has announced the addition of
    http://www.cnbc.com/id/39867831/
    Home News Markets Real-Time Quote US News Next Page
    Show Entire Article

    Research and Markets: Hashing in Computer Science: Fifty Years of Slicing and Dicing DUBLIN, Oct 27, 2010 (BUSINESS WIRE) Research and Markets (http://www.researchandmarkets.com/research/ceaa58/hashing_in_compute) has announced the addition of John Wiley and Sons Ltd's new book "Hashing in Computer Science: Fifty Years of Slicing and Dicing" to their offering. Written by one of the developers of the technology, Hashing is both a historical document on the development of hashing and an analysis of the applications of hashing in a society increasingly concerned with security. The material in this book is based on courses taught by the author, and key points are reinforced in sample problems and an accompanying instructor's manual. Graduate students and researchers in mathematics, cryptography, and security will benefit from this overview of hashing and the complicated mathematics that it requires. Key Topics Covered: PREFACE. PART I: MATHEMATICAL PRELIMINARIES. 1. Counting. 2. Recurrence and Generating Functions. 3. Asymptotic Analysis. 4. Discrete Probability Theory. 5. Number Theory and Modern Algebra. 6. Basic Concepts of Cryptography. PART II: HASHING FOR STORAGE: DATA MANAGEMENT. 7. Basic Concepts. 8. Hash Functions. 9.

    46. Hashing
    Support DFF If you benefit from the website, in terms of knowledge, entertainment value, or something otherwise useful, consider making a donation via PayPal to help
    http://www.delphiforfun.org/Programs/Math_Topics/hashing.htm
    Home Delphi Techniques Math Topics Library ... Utilities
    Search Search DelphiForFun.org only
    Support DFF If you benefit from the website, in terms of knowledge, entertainment value, or something otherwise useful, consider making a donation via PayPal to help defray the costs. (No PayPal account necessary to donate via credit card.) Transaction is secure. If you shop at Amazon anyway, consider using this link. We receive a few cents from each purchase. Thanks.
    Contact
    Feedback Send an e-mail with your comments about this program (or anything else). Search DelphiForFun.org only Hashing is a mathematical technique to convert a key into an array index. It is useful if we have keys with a limited set of unique values. For example, the set of Delphi reserved words or the set of words in the dictionary. It is further desirable that we access the entries many times - since retrieval is much faster than other types of searching, applications with many lookups are ideal candidates. The function that performs this conversion is called the hashing function and the array that we will index is called the hash table

    47. Hashing - Ph4
    hashing . The Hash House Harriers (abbreviated to HHH, H3, or referred to simply as hashing) is an international group of noncompetitive running, social, and drinking clubs.
    http://www.portlandhumphash.org/php/index.php?title=Hashing

    48. Hashing - C / C++ Answers
    hashing. Ask C / C++ questions and get answers from our community of C / C++ experts and professionals on BYTES.
    http://bytes.com/topic/c/answers/132012-hashing
    /** * vBulletin 3.7.6 CSS * Style: 'bytes.answers'; Style ID: 18 */ @import url("/clientscript/vbulletin_css/style-94eb1e9e-00018.css");
    • All Topics Business bytes c / c++ c / c++ questions
      Hashing
      snowteo Posts: n/a : Jul 22 '05 Hi,I have to do this exercises can you help me:
      1)Write a program to implement exetendible hashing.If the table is small
      enough to fin in main memory,how does its performance compare with open and
      closed hasing?
      2)A basic program consists of a series of statements,each of which is
      numbered in ascending order.Control is passed by use of a goto or gosub and
      a statement number.Write a program that reads in a legal BASIC program and
      renumbers the statements so that the first starts at number f and each statement has a number d higher than the previous statement.You may assume an upper limit of n statements,but the statement numbers in the input might be as large as a 32-bit integer.Your program must run in linear time.

    49. Search By Hashing
    Searching. Searching a list of values is a common task. An application program might retrieve a student record, bank account record, credit record, or any other type of record
    http://www.cs.bu.edu/teaching/cs113/spring-2000/hash/
    Search by Hashing
    Searching
    Searching a list of values is a common task. An application program might retrieve a student record, bank account record, credit record, or any other type of record using a search algorithm. Some of the most common search algorithms are serial search binary search and search by hashing . The tool for comparing the performance between the different algorithms is called run-time analysis . Here, we present search by hashing , and discuss the performance of this method. But first, we present a simple search method, the serial search and its run-time analysis
    Serial Search
    In a serial search, we step through an array (or list) one item at a time looking for a desired item. The search stops when the item is found or when the search has examined each item without success. This technique is probably the easiest to implement and is applicable to many situations.
    Serial Search - Analysis
    The running-time of serial search is easy to analyze. We will count the number of operations required by the algorithm, rather than measuring the actual time. For searching an array, a common approach is to count one operation each time that the algorithm accesses an element of the array.
    1. Worst-case

    50. Hashing - Definition And Meaning From Wordnik
    hashing Dictionary definitions and example sentences of hashing on Wordnik.com
    http://www.wordnik.com/words/Hashing
    Sign up! Sign in Zeitgeist Word of the day ... Random word Username Password ( Forgot? or Using Facebook Connect logs you in to Wordnik whenever you are logged in to Facebook. Not a member yet?
    Sign up for an account
    Hashing
    [x] Were you looking for hash Tweet Definitions Thesaurus Examples Pronunciations Comments Hashing in [x] No definitions are available for Hashing.
    Examples
    • Lydia, swearing fiercely, sword Hashing , still sat her horse, caking advantage of its greater height, or trying to: the confused, frightened animal, unused to battle, was more of a hindrance than a help. Castle Of Deception And in Hashing , like loving, there's NO FUCKING RULES! Madeline Schmidt "How do you know all this?" she demanded, all that dormant fierceness of the female heart Hashing from the depths to the surface. The Short Cut
    Pronunciations
    If you want to record a pronunciation for this word, or to ask us to record one, sign up or sign in
    Tags
    Hashing hasn't been tagged yet. Sign up or sign in to add tags.

    51. Hashing In Hong Kong And China
    Provides schedule and links to the hashing teams.
    http://home.netvigator.com/~hasher/
    The Home Page of the Hashes of Hong Kong
    The Hashes
    When they Run
    Who Runs
    Home Page
    Kowloon KH3 Monday 6.30 pm Men Only Hong Kong H4 Monday 6.00 pm Men Only Ladies LH4 Tuesday 6.45 pm Mainly Ladies Little Sai Wan H3 Wednesday 6.45pm Mostly anybody LSW Northern NTH3 Wednesday 7.00 pm Mixed (up ?) South Side H3 Thursday 6.30 pm Men Only Hong Kong Friday H3 Once a month - Friday 7:00 pm Open To All Wanchai WH3 Sunday 4.00 pm Men and goodlookers Sek Kong SKH3 Sunday 4.00 pm ex-Camp Followers Free China H3 Saturday pm All- once a month Sai Kung Saturday Hash 3rd Saturday of the Month (3.45pm) All Hong Kong Hash Babes Every two(2)months Saturday pm(time) Girls Only - and who dares HKHHB T8(The Dangerous) H3 At Typhoon Signal 8 All who dare Hashing in China - www.hashchina.com
    World Links - Flying Booger's Half-Mind Catalog
    Beaver Bam Bam Balls's Internet Home Page
    Harrier International Database

    GT's
    Global Trash

    52. Hash Coding From FOLDOC
    hashing hash coding programming, algorithm (Or hashing ) A scheme for providing rapid access to data items which are distinguished by some key.
    http://foldoc.org/hashing

    53. Dick Grune's Annotated Literature Lists
    hashing Literature references and annotations by Dick Grune, dick@cs.vu.nl. Last update Sat Sep 19 091912 2009. These references and annotations were originally intended for
    http://www.cs.vu.nl/~dick/Summaries/CS/Hashing.html
    Hashing
    Literature references and annotations by Dick Grune, dick@cs.vu.nl . Last update: Sat Sep 19 09:19:12 2009.
    These references and annotations were originally intended for personal use and are presented here only in the hope that they may be useful to others. There is no claim to completeness or even correctness. Each annotation represents my understanding of the paper at the moment I wrote the annotation.
    No guarantees given; comments and content criticism welcome. Maurizio Panti, Salvatore Valenti, "A modulus-oriented hash function for the construction of minimal perfect tables", ACM SIGPLAN Notices , #11, pp. 33-38. Nov. 1992, Chin-Chen Chang, Tzong-Chen Wu, "A letter-oriented perfect hash scheme based upon sparse table compression", Softw. Pract. Exper. , #1, Jan. 1991, pp. 35-49. F.J. Burkowski, G.V. Cormack, "Use of perfect hashing in a paged memory management unit", in 1990 International Conference on Parallel Processing, Illinois , 1990, pp. 96-100. Peter K. Pearson, "Fast hashing of variable-length text strings", Commun. ACM

    54. About Hashing
    Mystique of the Hash . The Summit Hash House Harriers were founded in 1980 as a mixed hash (men and women). We have had over 1000 hash runs as of April, 2006.
    http://www.hashnj.com/about.htm

    Mystique of the Hash
    The Summit Hash House Harriers were founded in 1980 as a mixed hash (men and women). We have had over 1000 hash runs as of April, 2006. Each run has been unique, unpredictable, occasionally messy, but always fun.
    What is Hashing?
    Running through some of the most remote and exotic terrain in the world, while enjoying the satisfaction of quenching the resulting thirst by the consumption of more than adequate amounts of liquid refreshment, the Hash House Harriers have been described as "The drinking club with a running problem." The general idea: the "hare" for the week sets a trail for the "hounds" to follow. The hash run follows an unpredictable cross-country trail laid with simple trail-marks showing the way. A crafty hare will set "false trails," trying to foul-up the Front Running Bastards (FRB's) in the group, thus allowing the pack the opportunity to catch up. To make sure that the group stays together, harriers yell "ON-ON" when they see a trail-mark and are heading in the right direction. Shortcutting is a well respected skill of the seasoned harrier! That being said, the "hounds" follow the trail laid by the "hare" with the ultimate goal of reaching the refreshment at the end.

    55. Bangkok Monday Hash House Harriers
    Mixed Thailand kennel who have been hashing every Monday evening since 1982.
    http://www.bangkokmondayhhh.com/

    Bangkok Monday Hash House Harriers
    Running and drinking beer since 1982. Website last updated: 27 April, 2010 Home About us Committee Archives Run stats ... Hash links BMH3 is Noriega (817 runs), Crash (733), Spinning Dwarf (678), Raincoat (579), Joylide (566), Maverick (526), Ajarn Kee Mao (473), Tinker (443), Bullit (435), Nearest and Dearest (392), Pink Panther (386), Man Called Horse (362) ... and you? Welcome to Bangkok Monday Hash House Harriers. We are a group of people who run for fun every Monday evening somewhere around Bangkok, and then drink a few beers and socialise afterwards. We are a very informal group, and we welcome anyone who wants to come along - Thai, foreigner, resident,visitor... Come along and see for yourself next Monday. Read more about Hashing If you are a visitor and want to make your own way to the run, read our Help For Visitors for advice about getting taxis etc. If you want to get a lift or share a taxi, checkout the committee members The Next Hare The next hare is No Meat , pictured on the right. That's one small step for a man, one giant leap for No Meat.

    56. Jamaica Hash House Harriers - Home Page
    hashing in the shadow of the Blue Mountains, running loose in the land of rum, reggae and JAH3 runs.
    http://jah3.virtualave.net
    Hare Line The Pack For Virgins
    Guestbook
    ... Songs Jamaica Hash House Harriers
    February 13, 1998 - 2008
    Kingston, Jamaica
    J AH3, based in Kingston, is a family Hash embracing a full spectrum of nationalities and ranging from one year old to those with more Hash runs behind, than in front of them.
    The runs *usually* take place every other Sunday afternoon, at different locations. Everyone with a sense of humor is welcomed, just show up, run or walk, and socialize!
    Who We Are!
    Pack Size 126 Upcoming Runs Hare Line ...
    "Jamaica Farewell"

    by Debra Ehrhardt
    A "humorous and compelling view"

    of Jamaica in the 70ies!
    Congratulations to the newly weds! Hot Shots Run 335- Norbrook Share your hash trash on Facebook Tarzan's Videos on Youtube: JAH3 Hash Olympics 2008 JAH3 Street Dance 2001 Unlike Columbus, ending on Jamaica's shores being drunk, we enjoy our brew AFTER the run! "Think responsibly, drink responsibly!"
    J AH3 is grateful for the continued support of our sponsor!

    57. The UK Hash House Harriers Website, Events Diary, Directory And News For Hashers
    Directory about hashing in the United Kingdom and Europe, including a UK event list and related links.
    http://www.hhh.org.uk/

    58. Athens Hash House Harriers - Jogging And Social Club - Greece
    Upcoming runs, social events, hashing weekends, run reports, club records and achievements, related links and contact information.
    http://www.athenshash.com
    About us
    Contact us
    Upcoming
    Photos
    Awards
    AH3 run totals
    Namings
    Past runs
    Resources
    Interest
    News Jokes History Hangouts Hash biz Downloads Dionysos Internat. Other H New Links Sponsors Articles ON-IN and welcome, visitor number Today is:
    This site is a member of WebRing. To browse visit here Athens Time Houston Time - Graphics and website design by Robert Horne (Mad Dog) -

    59. SH3 | Welcome To The Scarborough Hash House Harriers | Www.sh3.co.uk | On! On!
    Gives details of members, dates of runs with locations, photos of previous runs and a history of hashing. Scarborough.
    http://www.sh3.co.uk/
    You are here: Home Next hash: The Plough, Scalby (and every Sunday from The Alma
    NEWS
    Remember to rate the hashes you have done by logging into the members section!
    Lots of new pictures in the gallery!
    New toys! Lots of new stuff to play with, more here
    Hash HQ on the telly - more here!
    Welcome to the Scarborough Hash House Harriers
    The Scarborough Hash House Harriers meet every Monday at 6.30pm from a different venue, usually a pub, and every Sunday from the Alma Inn (hash HQ) at 11.00am. We are a non-competitive running club catering for all abilities. We lay our trails with plenty of false trails, long/short splits and sometimes beer stops and regroups, It isn't a race, it's about having fun. You can Hash at any level of fitness and at any age, although good attitude, personality, thirst, humour and a sharp wit are important attributes. We've been called a 'drinking Club with a running problem' and so if you have half a mind that's all you need. All you need is a pair of old running shoes and a spare set of clothing. There is no discrimination, be it sex, age or anything else and nobody gets left behind.
    How do I join?

    60. Andorra Hash House Harriers - Running And Drinking In The Mountains
    Includes event summaries and history of the club and hashing in general.
    http://andorrahash.org/

    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  

    Page 3     41-60 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20

    free hit counter