Trie - PDFSEARCH.IO - Document Search Engine

Trie
Results: 613

#	Item
191	Kelips∗: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse Cornell University, Ithaca, NY, USA {gupta, k Add to Reading List Source URL: iptps03.cs.berkeley.edu Language: English - Date: 2003-02-10 13:10:45 Distributed hash table Pastry Tapestry Peer-to-peer Gossip protocol Gnutella AVL tree Replication Trie Distributed data storage Computing Chord
192	An(other) Entropy-Bounded Compressed Suffix Tree Johannes Fischer ¨ Veli Makinen Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-19 08:50:58 Arrays Suffix array Suffix tree Compressed suffix array Linguistic morphology Trie Entropy Diminutive Computing Computer programming Data management
193	PDF Document Add to Reading List Source URL: www.ifa.hawaii.edu Language: English - Date: 2006-03-22 19:04:24 Binary trees Search algorithms R-tree K-d tree Binary search tree Backtracking Algorithm Trie Tango tree Mathematics Computing Graph theory
194	Overcoming the Barriers to Sustained Petaflop Performance William D. Gropp Computer Science Add to Reading List Source URL: www.irisa.fr Language: English - Date: 2007-12-03 03:37:03 Procedural programming languages Parallel computing Sparse matrix Central processing unit Sizeof Fortran ALGOL 68 Matrix Trie Computing Software engineering Computer programming
195	Cache-Oblivious Index for Approximate String Matching Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-07-27 14:38:02 Analysis of algorithms Cache Computational complexity theory Search algorithms B-tree Trie Cache-oblivious algorithm Suffix tree Time complexity Theoretical computer science Computer science Computing
196	Microsoft PowerPoint - CPM2010.pptx Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:58 Suffix tree Suffix array Compressed suffix array Search engine indexing Compressed data structure Trie Diminutive Summation Substring index Information science Information retrieval Information
197	High Performance GraphicsC. Dachsbacher, J. Munkberg, and J. Pantaleoni (Editors) Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras Add to Reading List Source URL: devblogs.nvidia.com Language: English - Date: 2015-01-29 19:09:45 Octree B-tree Bounding volume hierarchy Radix tree K-d tree Trie Tree traversal Tree Sorting algorithms Graph theory Computing Data management
198	Add to Reading List Source URL: cuba.coventry.ac.uk Language: English - Date: 2013-02-27 05:50:34 Trie Usability Search engine indexing Google Search Text corpus Radix tree Information science Science Information retrieval
199	Department of Electrical and Computer Systems Engineering Technical Report MECSE Add to Reading List Source URL: www.ecse.monash.edu.au Language: English - Date: 2007-11-01 21:55:37 Central processing unit Models of computation Dataflow architecture CPU cache Dataflow Parallel computing Cell Instruction set Trie Computer architecture Computing Computer engineering
200	Theory and Practice of Monotone Minimal Perfect Hashing DJAMAL BELAZZOUGUI Université Paris Diderot–Paris 7, France PAOLO BOLDI Università degli Studi di Milano, Italy RASMUS PAGH Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2011-11-04 10:29:52 Information retrieval Information science Trie Perfect hash function Hash function Bit array Logarithm Bloom filter Hash table Search algorithms Hashing Mathematics

UPDATE