Trie - PDFSEARCH.IO - Document Search Engine

Trie
Results: 613

#	Item
201	Distributed and Paged Suffix Trees for Large Genetic Databases Raphaël Clifford and Marek Sergot , Imperial College London, UK Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2003-07-07 11:33:13 Trie Substring Data management Suffix array Dynamic programming Suffix tree Computing Computer programming
202	Finding New Information via Robust Entity Detection Francisco Iacobelli and Nathan Nichols and Larry Birnbaum and Kristian Hammond Intelligent Information Laboratory Northwestern University 2133 Sheridan Rd. Evanston, IL Add to Reading List Source URL: infolab.northwestern.edu Language: English - Date: 2011-04-14 17:04:32 Record linkage Precision and recall Entity Trie Science Information Named-entity recognition
203	OpenDHT: A Public DHT Service and Its Uses Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, and Harlan Yu UC Berkeley and Intel Research Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-06-20 07:39:06 Distributed hash table Chord Peer-to-peer Hash table Prefix hash tree Lookup table PlanetLab Trie Kademlia Distributed data storage Computing Computer programming
204	MEIT: Memory Efficient Itemset Tree for Targeted Association Rule Mining Add to Reading List Source URL: www.philippe-fournier-viger.com Language: English - Date: 2014-01-13 11:26:23 Computing Information technology management Association rule learning Data management B-tree Tree traversal T-tree Tree Trie Binary trees Graph theory Data mining
205	Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar {hasanj, vijay} @ecn.purdue.edu Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-07-14 13:20:18 Trie Radix tree Distributed data storage Binary search tree Longest prefix match Routing B-tree Ctrie Radix sort Computing Network architecture Internet
206	A Case Study in Building Layered DHT Applications Yatin Chawathe† Sriram Ramabhadran∗ Sylvia Ratnasamy‡ Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-06-20 15:46:58 Distributed hash table Prefix hash tree Chord Peer-to-peer Trie P-Grid B-tree Binary search tree Binary tree Distributed data storage Computing Computer programming
207	Algorithms for Advanced Packet Classification with Ternary CAMs Karthik Lakshminarayanan UC Berkeley Joint work with Anand Rangarajan and Srinivasan Venkatachary Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-09-11 17:13:44 Content-addressable memory Trie Transmission Control Protocol Data Computer networking Computing Computer memory
208	Microsoft PowerPoint - paper281_HasVij Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-09-11 17:06:08 Lookup Throughput Transmission Control Protocol Computing Associative arrays Trie
209	Cache-conscious Frequent Pattern Mining on a Modern Processor Amol Ghoting1 , Gregory Buehrer1 , Srinivasan Parthasarathy1∗ Daehyun Kim2 , Anthony Nguyen2 , Yen-Kuang Chen2 , and Pradeep Dubey2 Department of Computer S Add to Reading List Source URL: www.vldb2005.org Language: English - Date: 2005-08-02 11:20:50 Information Cache Binary trees Association rule learning Data management Computer memory CPU cache B+ tree Trie Data mining Computing Information technology management
210	Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing Haoyu Song Sarang Dharmapurikar Jonathan Turner John Lockwood l.e Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-06-22 10:41:44 Information science Artificial intelligence Hash table Bloom filter Hash function Trie Lookup table Cryptographic hash function Hash list Hashing Search algorithms Information retrieval

UPDATE