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

81-100 of 168    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 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)

Hash tables in PRAM and VLSI models (Technical report / Dipartimento di informatica, Università di Pisa) by Fabrizio Luccio, 1989 Parallel access to hash tables (Technical report / Dipartimento di informatica, Università di Pisa) by Fabrizio Luccio, 1989 A new method for generating minimal perfect hash functions by Thomas J Sager, 1984 Rationale for bit fixing in the MDC-2 algorithm (Research report RC. International Business Machines Corporation. Research Division) by Don Coppersmith, 1999 Application of finite fields to memory interleaving (HP Laboratories technical report) by Abraham Lempel, 1992 Load balancing and hot spot relief for hash routing among a collection of proxy caches (Research report RC. International Business Machines Corporation. Research Division) by Kun-Lung Wu, 1999 On-the-fly compression of logical circuits (Research report RC. International Business Machines Corporation. Research Division) by Malay K Ganai, 2000 An O(n log n) algorithm for finding minimal perfect hash functions (TR) by E. A Fox, 1989 Hello, are you human? (GIT-CC) by Jun Xu, 2001 LEND and faster algorithms for constructing minimal perfect hash functions by E. A Fox, 1992 The correctness proof of a quadratic-hash algorithm by A. Nico Habermann, 1975 A composition theorem for universal one-way hash functions (Research report / International Business Machines Corporation. Research Division) by Victor Shoup, 1999 Implementation of a perfect hash function scheme (TR) by Sanjeev Datta, 1989 Un algorithme parallele de fermeture transitive utilisant un placement par hachage =: A parallel transitive closure algorithm using hash-based clustering ... Recherche en Informatique et en Automatique) by Jean-Pierre Cheiney, 1988

lists with details

81. Hardy's Hash House Harriers - Home Page
    Weymouth, active in South Dorset. History, diary, code, links, and contacts. Meets Sunday mornings and Thursday evenings.  
    http://www.geoffkirby.co.uk/Hashing
    
    Extractions: Hash History Hash Diary Hareway Code Sub60 Diary Mis-Management Minutes Please click on a Cerne Abbas Giant logo above to go to that site Scroll to the bottom of this page to meet the new Mis-Management! The Diary includes hashes up to and including 23rd May 2004. Please click on the DIARY icon above. The Hash Reports have been updated to include the Royal Oak, Bere Regis on 2nd May 2004. Please click here to go straight to these. The minutes from the Mis-Management meetings have been updated and the Hash Finances for FY 2003/4 are on the same page, please click here to go straight to them. Pictures of the Restaurant Hash, Halloween Hash and Hartland Quay Walk will be removed from the web around the middle of May so please click here for a last look. The DIARY page now has links to all UK and Worldwide Hashing events. TEIGN VALLEY H3 'HOT HARRIETTES' 2005 CALENDAR BOF is ordering a copy for you to see and he will then collate orders for this very worthy cause. Hashing consists of following a trail laid in flour. It is non-competitive and caters for all levels of fitness. Many "regroups" are set to allow slower hashers to catch up before the "pack" sets off again. Described as "Drinkers with a Running Problem", Hardy's Hash House Harriers are a part of a long and proud Hashing tradition, see the

82. MySQL Manual | 5.4.9 Password Hashing In MySQL 4.1
    MySQL Manual 5.4.9 Password hashing in MySQL 4.1. 5.4.9 Password hashing in MySQL4.1. MySQL user accounts are listed in the user table of the mysql database.  
    http://dev.mysql.com/doc/mysql/en/Password_hashing.html
    
    Extractions: MySQL Newsletter! Previous Next Up Table of Contents MySQL user accounts are listed in the user table of the mysql database. Each MySQL account is assigned a password, although what is stored in the Password column of the user table is not the plaintext version of the password, but a hash value computed from it. Password hash values are computed by the function. MySQL uses passwords in two phases of client/server communication: When a client attempts to connect to the server, there is an initial authentication step in which the client must present a password that has a hash value matching the hash value stored in the

83. MySQL Manual | 4.3.11 Hashing De Senhas No MySQL 4.1
    Translate this page MySQL Manual 4.3.11 hashing de Senhas no MySQL 4.1. 4.3.11 hashingde Senhas no MySQL 4.1. As contas de usuários do MySQL estão  
    http://dev.mysql.com/doc/mysql/pt/Password_hashing.html
    
    Extractions: MySQL Newsletter! Previous Next Up Table of Contents As contas de usuários do MySQL estão lisatadas na tabela user do banco de dados mysql . Para cada conta do MySQL é definida uma senha, no entanto o que está armazenado na coluna Password da tabela user não seja uma versão da senha em texto puro, mas um valor hash computado para ela. Valores hash de senha são calculados pela função O MySQL usa senhas em duas fases da comunicação cliente/servidor: Primeiro, quando um cliente tenta se conectar ao servidor, existe uma etapa de autenticação inicial na qual o cliente deve apresentar uma senha que combina com o valor hash armazenado na tabela de usuários para a conta que aquele cliente deseja usar.

84. Daily Nation On The Web
    Oyunga Pala, Daily Nation on the Web Saturday Magazine  
    http://www.nationaudio.com/News/DailyNation/120699/Features/story2.html
    
    Extractions: Saturday, June 12, 1999 A Story of Hashing By Oyunga Pala Cover of the Saturday Magazine The Hash House Harriers is a social club of runners described as 'a drinking club with a running problem'. Expatriate British businessmen, accountants, lawyers, civil servants and the like started the hash in 1938 in Kuala Lumpur, Malaysia. It is based on the old English sport of hares and hounds. The founder of the hash, A.S. 'G' Gispert, in 1937 discovered the Springgit Harriers, one of the paper chase clubs, in Malacca. He introduced Ronald 'Torch' Bennett to the concept and the stage was set. When 'G' returned to Kuala Lumpur in 1938, he became a member of the Federated Malay States Volunteer Reserves which trained on Mondays. 'G' and many of the other expatriate Britons were housed in barracks in the Royal Selangor Club where he and 'Torch' would often discuss starting a harrier club in KL (Kuala Lumpur). Finally, around December of 1938, 'G' convinced a dozen others to follow his inaugural paper trail. Gispert then suggested the name Hash House Harriers in mock allusion to the mess at the Selangor Club, where many of them dined. The runs were held on Monday evenings after reserve training, and were followed by refreshment with Tiger beer. Gispert was killed in battle defending Singapore from the Japanese at 4am on February 11, 1942. The hash has grown from those humble beginnings to include thousands of chapters and tens of thousands of hashers world-wide.

85. Sumo Hash House Harriers
    Contains links about life in Japan, upcoming events, description of the club, history and hashing links.  
    http://gotothehash.net/japan/sh3.html

86. Ray Tracing News, Volume 9, Number 1
    EAH. back to contents. 3D Point hashing, by Steve Worley (spworley@best.com).I asked Steve if he had any good hashing function for 3D points in space.  
    http://www.acm.org/tog/resources/RTNews/html/rtnv9n1.html
    
    Extractions: Ray Tracing News "Light Makes Right" January 18, 1996 Volume 9, Number 1 Compiled by Eric Haines erich@acm.org . Opinions expressed are mine. Archive locations: anonymous FTP at ftp://ftp.povray.org/pub/povray/Ray-Tracing-News/ ftp://princeton.edu/pub/Graphics/RTNews/ ftp://wuarchive.wustl.edu/graphics/graphics/ray/RTNews/ ,and others. HTML at http://www.povray.org/rtn/index.html , among others. You may also want to check out the Ray Tracing News issue guide and the ray tracing FAQ Introduction Results of the Name that Area Ratio Contest, by Eric Haines and Arijan Siska Another Contest: Sphere in Box ratio, by Eric Haines Ray Tracing Roundup A Freeware modeller supporting VRML, by Stephen Chenney 3D Point Hashing, by Steve Worley 5D vs. BSP and ABVH, by Nguyen Duc Cuong aka "JuHu" Interacting with Ray Traces, by Bert Peers Hierarchical Techniques for Glossy Global Illumination, by Per Christensen Global Illumination SIGGRAPH meeting, by Greg Ward Total Internal Reflection, by Eric Haines, Greg Ward, and Chris Larson Pretemporal Imaging Systems,

87. Kobe H3 Home Page
    Japan's second oldest Hash. Been hashing every Monday at since 1978, come hail, highwater or earthquake.  
    http://www.kobehash.com
    
    Extractions: Kobe Hash House Harriers THE KOBE HASH HOUSE HARRIERS of Kobe, Japan are the second oldest Hash in the country, and Kansai's Mother Hash. We have been hashing every Monday at 7:00 pm since 9th January 1978, come hail, highwater or earthquake. Run #1400, 3 May. Today makes it 1400 times we've done it. Well, the Kobe Hash has hashed, that is. Al-kanida will hare at Hankyu Ashiyagawa. He promises a run which will be 'different'. Meet at 3:00 pm. This site is a member of WebRing. To browse visit here

88. Collision-Resistant Hashing Towards Making UOWHFs Practical
    CollisionResistant hashing Towards Making UOWHFs Practical. AuthorsM. Bellare and P. Rogaway Abstract Recent attacks on the  
    http://www.cs.ucsd.edu/users/mihir/papers/tcr-hash.html
    
    Extractions: Authors: M. Bellare and P. Rogaway Abstract: Recent attacks on the cryptographic hash functions MD4 and MD5 make it clear that (strong) collision-resistance is a hard-to-achieve goal. We look towards a weaker notion, the universal one-way hash functions Ref: Extended abstract was in Advances in Cryptology- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997. Full paper available below. Full paper: Available as compressed postscript postscript , or pdf Help if this doesn't work). Improvements by Victor Shoup. Hash Functions: From Merkle-Damgard to Shoup by Ilya Mironov

89. Tokyo Ladies Hash House Harriers
    Home of the Tokyo Ladies Hash House Harriettes. Photographs, management, hash trash, hashing in Japan, and links.  
    http://gotothehash.net/japan/tlh3.html

90. Bellare - Incremental Cryptography
    Incremental cryptography the case of hashing and signing. A New Paradigmfor collisionfree hashing Incrementality at reduced cost.  
    http://www.cs.ucsd.edu/users/mihir/papers/incremental.html
    
    Extractions: Incremental cryptography is a way to speed up the computation of cryptographic functions (eg. signatures, hash functions, MACs) in certain settings. The idea is that if we have already computed the function on some document, and this document is modified, then we update the function value based on the old value rather than re-computing it from scratch. The idea was introduced by Bellare, Goldreich and Goldwasser in the papers Incremental cryptography: the case of hashing and signing and Incremental cryptography with application to virus protection . More efficient solutions for hashing were found in A new paradigm for collision-free hashing: Incrementality at reduced cost Authors: M. Bellare, O. Goldreich and S. Goldwasser Abstract: We initiate the investigation of a new kind of efficiency for cryptographic transformations. The idea is that having once applied the transformation to some document M, the time to update the result upon modification of M should be ``proportional'' to the ``amount of modification'' done to M. Thereby one obtains much faster cryptographic primitives for environments where closely related documents are undergoing the same cryptographic transformations. We provide some basic definitions enabling treatment of the new notion. We then exemplify our approach by suggesting incremental schemes for hashing and signing which are efficient according to our new measure.

91. Hash Home Page
    Information, contacts, and links for people who want to find out about following the flour in south Florida.  
    http://www.angelfire.com/fl2/tropicalhashingUSA/
    
    Extractions: var cm_role = "live" var cm_host = "angelfire.lycos.com" var cm_taxid = "/memberembedded" hashing in south florida your source for information on exciting hashing action in south florida from miami to jupiter, and occasionally beyond...information is also available on the following hotline phone numbers: miami/ft lauderdale (954)680-hash hurricane/corned beef hashes in palm beach (561)585-9058 palm beach hash house harriers (561) 753-0940 read on on for all the information you need to make it to the next hash. the same kind of information should be available on the south florida hash hotline; that's (954) 680-hash. use the hotline to leave messages for the webfuehrer, or e-mail at the address below. get your red dresses (and white and blUE accessories) ready! anal red dress run DATE: SATURDAY, JUNE 23rd 5:00 P.M. happy hour- hares away at 6:00! Starting from behind the outback steak house at linton blved in delray beach, just off i-95 erections: take i-95 to linton blvd, exit at linton going east, and watch on the left for the outback steak house. drive around back, and look for the pack of red clad hashers.

92. KFC's Place
    KFC's personal collection of northeast Florida hashing and hashing links.  
    http://www.H3KFC.com/
    
    Extractions: Welcome to KFC's Place! Send me Mail 34' RV For Sale! Click here for more details See KFC's Stuff for Sale (Wanna sell stuff here?) Harley's Memorial Page (She brought so much love to our lives) Around the DZ (Photos of Skydivers in their natural habitat) Family and Friends (Misc photos non-Skydiving/Hashing)

93. Mulle KybernetiK - Optimized Hashing In Mac OS X
    Mulle kybernetiK Tech Info v0.6. Obj-C Optimization Optimized hashingin Mac OS X. are certainly welcome. Optimized hashing in Mac OS X.  
    http://www.mulle-kybernetik.com/artikel/Optimization/opti-7.html
    
    Extractions: Mulle kybernetiK - Tech Info: v0.6 Obj-C Optimization: Optimized Hashing in Mac OS X This seventh installment of the ongoing series "How to optimize in Objective-C" talks about: The importance of using a good hash. What is a good hash in Mac OS X ? Why Apple's hash code is lame. (c) 2002,2004 Mulle kybernetiK - text by Nat! with help by erik This articles starts with an intro about hashing for the budding coder. Seasoned veterans amble down to "Unfortunately on Mac OS X, it's not so simple" You can download my test cases. Since these are projects made with ProjectBuilderWO you will have to import it into XCode, if you don't have ProjectBuilderWO installed. You can install ProjectBuilderWO from the older developer CDs as a custom install option or from the new developer CD as an optional package in the packages folder if you run on pre-Panther Mac OS X. Every instance of NSObject or any of its subclasses (or more exact, every class that implements the NSObject protocol) responds to the message -hash . To really drive this home, 99% of all classes respond to

94. Panama City Hash House Harriers
    Schedules and contacts for hashing in Panama City, Florida; jewel of the Redneck Riviera. hashing in the central time zone since 15 Dec 1992.  
    http://www.geocities.com/hasherctt/PCHHH.html

95. Neighborhood Preserving Hashing And Approximate Queries
    Neighborhood Preserving hashing and Approximate Queries. Key words. approximatequery, hashing, isoperimetric inequality, error correcting code.  
    http://epubs.siam.org/sam-bin/dbq/article/31809
    
    Extractions: pp. 73-85 Abstract. approximate query u in Hamming distance. The problem reduces to the following combinatorial problem: Hash the vertices of the n -dimensional hypercube into buckets so that (1) the c neighborhood of each vertex is mapped into at most k buckets and (2) no bucket is too large. Lower and upper bounds are given for the tradeoff between k and the size of the largest bucket. These results are used to derive bounds for the approximate query problem. Key words. approximate query, hashing, isoperimetric inequality, error correcting code AMS Subject Classifications DOI Retrieve PostScript document ( 31809.ps : 439144 bytes) Retrieve GNU Compressed PostScript document ( ... Retrieve reference links

96. The Tree Model For Hashing: Lower And Upper Bounds
    The Tree Model for hashing Lower and Upper Bounds. Joseph Gil Wigderson.Abstract. We define a new simple and general model for hashing. The  
    http://epubs.siam.org/sam-bin/dbq/article/25572
    
    Extractions: pp. 936-955 Abstract. We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of applications of a hash function on a single key. Key words. parallel algorithms, randomization data structures AMS Subject Classifications DOI Retrieve reference links

97. Mount Vernon Hash House Harriers - Northern Virginia USA
    Mount Vernon Hash House Harriers Home Page. hashing in Northern Virginia.  
    http://www.dchashing.org/mvh3/

98. Tidewater Hash House Harriers
    Tidewater Hash House Harriers. hashing all over Hampton Roads, VA. Come on out and discover the fun way to run. We run offroad in the fashion of the English Hare and Hounds game. Short trails, good company, and much socializing!  
    http://www.th3.org/

99. Richmond H3
    Drinkers with a Running Problem. hashing in and around Richmond, VA.  
    http://www.richmondhash.com/

100. ACM Queue
     ACM Queue Forums. DSP of hash and rehashing. dfreitag Guest, PostPosted Mon May03, 2004 538 pm Post subject DSP of hash and re-hashing, Reply with quote.  
     http://www.acmqueue.com/modules.php?name=Forums&file=viewtopic&p=155

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

81-100 of 168    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20