Trie - PDFSEARCH.IO - Document Search Engine

Trie
Results: 613

#	Item
71	B-trees, Shadowing, and Clones Ohad Rodeh IBM Haifa Research Labs B-trees are used by many file-systems to represent files and directories. They provide guarantied logarithmic time key-search, insert, and remove. File sy Add to Reading List Source URL: liw.fi Language: English - Date: 2011-11-26 13:43:39 B-tree Learning Graph theory Computing B+ tree Trie Tree Btrfs Hilbert R-tree
72	Legion: Expressing Locality and Independence with Logical Regions Michael Bauer Sean Treichler Add to Reading List Source URL: legion.stanford.edu Language: English - Date: 2016-06-09 19:48:59 Parallel computing Computing Computer programming Software engineering Data parallelism Distributed memory B-tree Tree Trie Computer cluster
73	Dynamic Code Management: Improving Whole Program Code Locality in Managed Runtimes Xianglong Huang Brian T Lewis Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2006-04-02 19:37:27 Mathematics Search algorithms Applied mathematics Computer programming Dynamic programming Equations Operations research Optimal control Systems engineering Force-directed graph drawing Depth-first search Trie
74	Microsoft Word - separatorpagesMobileHCI2008proceedings.doc Add to Reading List Source URL: ilk.uvt.nl Language: English - Date: 2008-08-28 05:03:15 Input/output Computing Natural language processing Computer hardware Language Mobile technology Computational linguistics Predictive text Trie Autocomplete Typing T9
75	Application Note: Scalable HashingProblem How can you use Judy to create a scalable hash table with outstanding performance and automatic scaling, while avoiding the complexity of dynamic hashing? Add to Reading List Source URL: judy.sourceforge.net Language: English - Date: 2004-09-10 16:20:39 Search algorithms Information science Information retrieval Hashing Computer programming Hash table Hash function Trie Judy array Hash Cuckoo hashing 2-choice hashing
76	Hoogλe Fast Type Searching Neil Mitchell www.cs.york.ac.uk/~ndm/ Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Computing Computer programming Data types Finite automata Trie Haskell Edit distance Set String Associative containers
77	Monte Mario: Platforming with MCTS Emil Juul Jacobsen Rasmus Greve Julian Togelius Add to Reading List Source URL: julian.togelius.com Language: English - Date: 2014-07-22 08:28:18 Game artificial intelligence Monte Carlo tree search General game playing A* search algorithm Tree traversal Super Mario Artificial intelligence Trie Tree
78	A N TRIE BSTE C H N IK M U LT I D I R E K T I O N A L E R A N T R I E B www.polyscope.ch Add to Reading List Source URL: www.rezero.ethz.ch Language: German - Date: 2011-01-29 12:32:40
79	Engineering Burstsort: Toward Fast In-Place String Sorting RANJAN SINHA and ANTHONY WIRTH The University of Melbourne Burstsort is a trie-based string sorting algorithm that distributes strings into small buckets whose Add to Reading List Source URL: www.cs.amherst.edu Language: English - Date: 2010-04-06 17:17:46
80	October 14, Spring 2009 Quiz 1 Solutions Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2010-02-02 11:49:58 Computer programming Arrays Mathematical analysis Computing Finite automata Trie B-tree Master theorem Hash table

UPDATE