<--- Back to Details
First PageDocument Content
Information science / Artificial intelligence / Hash function / Extendible hashing / Cryptographic hash function / Hash / Hash table / Linear hashing / Hashing / Search algorithms / Information retrieval
Date: 2007-10-16 15:37:26
Information science
Artificial intelligence
Hash function
Extendible hashing
Cryptographic hash function
Hash
Hash table
Linear hashing
Hashing
Search algorithms
Information retrieval

Add to Reading List

Source URL: www.smckearney.com

Download Document from Source Website

File Size: 85,09 KB

Share Document on Facebook

Similar Documents

Game artificial intelligence / Routing algorithms / Computer programming / Computing / Mathematics / Automated planning and scheduling / Theoretical computer science / Macro / Satisficing / A* search algorithm / Planning Domain Definition Language / Heuristic

Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo

DocID: 1xUEX - View Document

Theoretical computer science / Automated theorem proving / Mathematics / Mathematical logic / Formal methods / Logic in computer science / Resolution / Logic programming / Clause / Vampire / Boolean satisfiability problem / CARINE

Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo

DocID: 1xTM6 - View Document

Chapter 3 Classical Optimization and Search Techniques In this chapter we discuss a few popular optimization techniques in use in current day natural language processing algorithms. First we present the Hidden Markov

DocID: 1uSjw - View Document

Line Search for Averaged Operator Iteration Pontus Giselsson, Mattias F¨alt, and Stephen Boyd Abstract Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford sp

DocID: 1uOGW - View Document

Graph theory / Graph connectivity / Graph traversal / Depth-first search / Bridge / Biconnected component / Cycle / Strongly connected component / Connected component / Reachability / Graph / Connectivity

Structuring Depth-First Search Algorithms in Haskell David J. King John Launchbury Department of Computing Science

DocID: 1uNEx - View Document