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

41-60 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)

Internal hashing for dynamic and static tables by T. G Lewis, 1988 Multilevel trie hashing (Rapports de recherche. Institut National de Recherche en Informatique et en Automatique) by W Litwin, 1987 Latency-sensitive hashing for collaborative web caching (Research report RC. International Business Machines Corporation. Research Division) by Kun-Lung Wu, 2000 Parallel hashing: An efficient implementation of shared memory (Research Report RJ. International Business Machines Corporation. Research Division) by Anna R Karlin, 1986 Split sequence coalesced hashing (Technical report) by D Murthy, 1988 Hashing-based traffic splitting algorithms for internet load balancing (GIT-CC) by Zhiruo Cao, 1999 An experimental method of study for minimal perfect hashing function: Reciprocal hashing by Dusaneya Somsiri, 1987 Analysis of some new variants of coalesced hashing (Techincal report / Brown University, Dept. of Computer Science) by Wen-Chin Chen, 1984 Universal hashing in VLSI: (extended abstract) (Technical report. Pennsylvania State University. Dept. of Computer Science) by Martin Furer, 1987 An extended study on ordered minimal perfect hashing scheme by Li-Pan Huang, 1986 Deletion algorithms for coalesced hashing (Technical report / Brown University, Dept. of Computer Science) by Wen-Chin Chen, 1984 An algorithm for garbage collecting in a hashing environment (Technical report - Indiana University, Computer Science Department) by Daniel P Friedman, 1976 Hashing moving objects (Computer science technical report series CS-TR) by Zhexuan Song, 2000 Hashing: Masters for making overhead slides (OSU-CS-TR) by George E Hedrick, 1995

lists with details

41. Hashing On The Internet
    hashing on the Internet. Obfuscation by Square Root, T AHHH New errors introduced,1/26/98. Netnews. The following are newsgroups devoted to hashing  
    http://users.sdsc.edu/~wilkinsn/hashing.internet.html
    
    Extractions: alt.hash.house.harriers a.h.h.h is the original internet hashing newsgroup. Unfortunately, very few computer systems carry it so traffic is low. Questions may go unanswered; announce- ments may go unnoticed. Devoted hashers should ask their system newsadmins to add this newsgroup. alt.org.h-h-harriers The a.o.h-h-h newsgroup was created in the summer of 1994 when several influential newsadmins pointed out that poor distribution of a.h.h.h was in part due to its name badly formed by netnews standards. Nevertheless, a.o.h-h-h isn't carried widely either. Help the cause and request it on your system. freenet.rec.runners.group-hash This is the newsgroup of the Cleveland HHH; it's available on the Cleveland Free-Net (freenet-in-a.cwru.edu). Cleve- land hashers don't write much here, but they do use the newsgroup to archive all the traffic from the worldwide Hash House Harriers mailing list, HASH-L.

42. Home Of Kazlib
    Kazlib is a package of four reusable software modules that provide some frequentlyneeded functionality. There is a dictionary module based on red-black trees, a hashing module capable of managing hash tables that grow automatically, and a well rounded module for managing linked lists. Also a portable exception handling module. The Kazlib code is clean, highly portable and contains powerful argument validation and self-checks that help debug your own code. The algorithms are efficient for efficienty, and implemented sensibly.  
    http://users.footprints.net/~kaz/kazlib.html
    
    Extractions: Kazlib is a collection of program modules portably written in ANSI C. There is a dictionary module based on red-black trees, an extendible hashing module, and a system for emulating exception handling. Selected modules of Kazlib are used in the following programs: Ethereal , a packet capture, analysis and display tool with a graphical interface uses the exception module from Kazlib to liberate packet dissector modules from the responsibility of having to check for truncated or corrupt packets. , the system file system checker for Linux's main file system uses the dictionary module from Kazlib to make it work faster over some severely corrupted filesystems. VeeJay , a live performance tool featuring non-linear editing and mixing from multiple audio/video sources. Webbase , an open-source web crawler that is ``efficiently able to crawl millions of URLs'' and stores the crawler information in a MySQL database, uses the hashing module over URLs. OpenIsis , software for publishing ISIS databases. CDS/ISIS is a storage and retrieval system developed by UNESCO. ISISd , an implementation of the IS-IS routing protocol, for the Zebra platform. This has nothing to do with OpenIsis or CDS/ISIS! Implementing ISISd was the subject of the

43. Welcome
    Gives details of members, dates of runs with locations, photos of previous runs and a history of hashing.  
    http://www.sh3.co.uk/

44. GH3 - Guildford Hash House Harriers
    hashing club meeting weekly. Profile, events and information about the club.  
    http://www.guildfordh3.org.uk/
    
    Extractions: Take the A322 from Guildford, through Stoughton, Worplesdon to Brookwood. Straight over the traffic lights past Sainsburys and then at second junction on the right TR into Chobham Road. Follow through traffic lights on to Chobham village. Carry on through High Street over mini RA into B383 Windsor Road for 3 to 4 miles going over the M3, over a large RA until you reach the A30 at Sunningdale. TR and go along A30 past Virginia Water large car park until you reach junction on your left with Wick Road. TL here and go round sharp RH bend (now becomes Wick Lane) past park on your left until you reach Junction with Kings Lane on your right. Pub on the corner, park neatly in lanes. Alternatively you can go from Guildford, A31Hogs Back, A331 Blackwater Relief, M3Motorway to Lightwater and then A30 to Virginia Water. If the run details above are out of date, check out the

45. Hash Function - Wikipedia, The Free Encyclopedia
    Contrary to an assumption often voiced by people who don t follow the industry carefully,hashing algorithms do exist that are robust to these minor differences  
    http://en.wikipedia.org/wiki/Hash_function
    
    Extractions: Other languages: Deutsch From Wikipedia, the free encyclopedia. A hash function is a function that converts an input from a (typically) large domain into an output in a (typically) smaller range (the hash value , often a subset of the integers ). Hash functions vary in the domain of their inputs and the range of their outputs and in how patterns and similarities of input data affect output data. Hash functions are used in hash tables cryptography and data processing probably here is precise though indeterminate. If the set of all possible values of H(x) is much smaller than the set of all possible values of x, then this latter condition cannot be true if all sequences are equally likely. Thus, the second condition is often revised in different ways to make it plausible, or workable. For instance, cryptographic hash functions use the second condition in the form that given x, it is computationally very difficult to find y such that H(x) = H(y). Additionally, it is desirable that if we are given x and H(x + s) where + can be bit changing or concatenation, then we can't find s short of exhaustive enumeration. In practice, for most applications other than error correction, cryptographic hashes serve very nicely. The and SHA-1 algorithms are two of the most popular algorithms although any cryptosystem can be used to create a hash function (as, indeed, any cryptographically secure hash can be used to create a cryptosystem).

46. Onslow County Hash House Harriers
    Schedules, news, pictures, and general information about hashing from a club devoted to staging Hare and Hounds runs in eastern North Carolina.  
    http://groups.msn.com/OnslowCountyHashHouseHarriers/
    
    Extractions: var nEditorialCatId = 310; MSN Home My MSN Hotmail Shopping ... Money Web Search: Groups Groups Home My Groups Language ... Help Onslow County Hash House Harriers OnslowCountyHashHouseHarriers@groups.msn.com What's New Join Now Hashing Links Message Board ... On-On For a information about the OCH3 Contact I-DID-A-ROD at 910-265-5321 E-mail idar-och3@ec.rr.com Welcome to the Onslow County Hash House Harriers webpage! Located in and around Jacksonville and Swansboro, North Carolina. We offer friendly fun and debauchery! We usually run about 3-4 miles, on Sundays at 3pm. Check the "Upcumming Runs" for specific information. First runs are free! For run information, contact IDAR (I Did A Rod) Questions regarding the webpage? Contact BB Notice: Microsoft has no responsibility for the content featured in this group. Click here for more info. Try MSN Internet Software for FREE! MSN Home My MSN ... GetNetWise

47. Second City Hash House Harriers
    Schedules, contacts, and history of this Chicago area hashing club.  
    http://home.comcast.net/~secondcityhhh/

48. Howstuffworks "How Encryption Works"
    hashing Algorithms The key in publickey encryption is based on a hash value. Here sa simple example Input number, hashing algorithm, Hash value.  
    http://computer.howstuffworks.com/encryption5.htm
    
    Extractions: The key in public-key encryption is based on a hash value . This is a value that is computed from a base input number using a hashing algorithm . Essentially, the hash value is a summary of the original value. The important thing about a hash value is that it is nearly impossible to derive the original input number without knowing the data used to create the hash value. Here's a simple example: Input number Hashing algorithm Hash value Input # x 143 You can see how hard it would be to determine that the value 1,525,381 came from the multiplication of 10,667 and 143. But if you knew that the multiplier was 143, then it would be very easy to calculate the value 10,667. Public-key encryption is actually much more complex than this example, but that is the basic idea.

49. Pan Asia Hash 2003
    A hashing event. A list of prospective hashers, registration form, and a managerial contact listing.  
    http://www.panasiahash2003.com/

50. Hash Coding From FOLDOC
    hashing . hash coding. programming, algorithm (Or hashing ) A scheme for providingrapid access to data items which are distinguished by some key.  
    http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?hashing

51. Royal Milan & Bordighera Hash House Harriers
    All the informations you need for hashing in Milan and in Italy from the Royal Milan Bordighera Hash House Harriers. Updated regularly with runs, special events, writeups.  
    http://www.fahrenheit451.it/milanhhh/

52. Keyed-Hashing Message Authentication From FOLDOC
    Free Online Dictionary of Computing. Keyed-hashing Message Authentication. messaging, cryptography (HMAC) A mechanism for message  
    http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?Keyed-Hashing Message Authenticatio

53. The Boise Hash House Harriers Web Page
    hashing club. Information about meeting times.  
    http://boiseh3.org/
    
    Extractions: Internet Explorer version 3.0 or , you'll have a much more pleasant experience navigating around this site. Opera Users: Although Opera 3.0 supports JavaScript, there is a bug in their implementation which prevents the menu system on this site from working. Opera 3.2 fixes the problem. Note: If you have any problems with this site, please contact the Webmaster. Click here to see the non-JavaScript version of this site.

54. Princeton Hash House Harriers
    The drinking club with a running problem. Lists upcoming hashes, and provides general hashing information.  
    http://www.princetonol.com/groups/phhh/

55. Home Page
    Running and drinking club. Includes information on hashing, history and links.  
    http://gspothhh.tripod.com/

56. Java Theory And Practice: Hashing It Out
    Java theory and practice hashing it out,  
    http://www-106.ibm.com/developerworks/java/library/j-jtp05273.html
    
    Extractions: var title = "Java theory and practice: Hashing it out"; var contentAreaList = "java"; var demoURL = ""; Search for: within All of dW eServer Lotus Rational Tivoli WebSphere Autonomic computing Grid computing Java technology Linux Open source Web arch. Web services Wireless XML dW forums dW Subscription alphaWorks All of IBM Search help IBM home My account 27 May 2003 Every Java object has a and an method. Many classes override the default implementations of these methods to provide a higher degree of semantic comparability between object instances. In this installment of Java theory and practice , Java developer Brian Goetz shows you the rules and guidelines you should follow when creating Java classes in order to define and effectively and appropriately. Share your thoughts on this article with the author and other readers in the accompanying

57. TSTH3
    hashing in South Korea since 1999.  
    http://www.geocities.com/tsth3/TSTH3.html
    
    Extractions: Woody: (Vacant) You are visitor # * The Taegu San-Tokie Hash House Harriers was founded by Tim (Drag Queen) Richards on 28 August 1999. The hash meets every Saturday at 3 PM, the Friday closest to every Full Moon at 7 PM, and on holidays and special occasions (Times vary)(See dates below left). Will NOT meet the Saturday immediately following a Friday Full Moon Hash. Always a running trail, 4-6 miles and sometimes do Walking Trails if hares available; Full Moon trails are 4 miles. All trails are A to B. After a brief chalk talk (instructions), the Hares take off to lay trail; on Saturday and holiday runs, the pack follows 20 minutes later and then walks for 7 minutes before running; on Full Moon runs, the pack follows 15 minutes later and walks for 5.

58. Shared Memory
    HashMap and hashing I know you have bigger problems to solve right now but if youneed to give a break then read the following easy to understand, simple tips  
    http://jroller.com/page/talipozturk
    
    Extractions: Login All Java Other Resources Wednesday May 26, 2004 Quick and dirty transactional JavaSpace impl. A friend in Jini mailing list asked our opinion on implementing transactional JavaSpace which uses a Hashtable internaly. His plan was to copy the entire JavaSpace (hashtable) for each transaction and do all the operations (write/read/take) on the copy. Here is my response plus quick and dirty solution. obviously, as you said, when you have 1000s of entries and 100s of transaction happening at the same time, you will kill your system. you should only care about the deltas. instead of creating a entire copy of the main javaspace (hashtable), create an empty javaspace for each new transaction and call it transaction space. 1. for all reads, read from the transaction space first. if not found there, go read from your main space.

59. 32-bit Cyclic Redundancy Check (CRC) Class
    This check is used in numerous systems to verify the integrity of information. It's also used as a hashing function. Open Source, Public Domain  
    http://www.theorem.com/java/CRC32.java

60. Modern Password Hashing For Your Software And Your Servers
    PR.openwall.net Password Recovery Resources on the Net. Modern passwordhashing for your software and your servers. This is an implementation  
    http://www.openwall.com/crypt/
    
    Extractions: Openwall Project /home Owl JtR ... mirrors bringing security into open environments PR.openwall.net: Password Recovery Resources on the Net Modern password hashing for your software and your servers This is an implementation of a modern password hashing algorithm, based on the Blowfish block cipher, provided via the crypt(3) and a reentrant interface. It is compatible with bcrypt (version 2a) by Niels Provos and David Mazieres, as used in OpenBSD . A paper on the algorithm that explains its design decisions is available here The most important property of bcrypt (and thus crypt_blowfish) is that it is adaptable to future processor performance improvements, allowing you to arbitrarily increase the processing cost of checking a password while still maintaining compatibility with your older password hashes. Already now bcrypt hashes you would use are several orders of magnitude stronger than traditional Unix DES-based or FreeBSD-style MD5-based hashes. This code comes from John the Ripper You can use the provided routines in your own packages or link them into a C library. Hooks for linking into GNU libc are provided. Note that simply adding this code into your libc is probably not enough to make your system use the new password hashing algorithm. Changes to passwd(1), PAM modules, or whatever else your system uses will likely be needed as well. These are not a part of this package, but there's which uses the password hashing framework provided by crypt_blowfish, in the Owl

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

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