Trie - PDFSEARCH.IO - Document Search Engine

Trie
Results: 613

#	Item
91	Space-Efficient Data Structures for Top-k Completion Bo-June (Paul) Hsu Giuseppe Ottaviano Microsoft Research Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Computer programming Software engineering Computing Search algorithms Finite automata Trie Radix tree Binary trees Arrays Routing algorithms Suffix tree Tree
92	Bloom Filter Trie – a data structure for pan-genome storage Guillaume Holley1,2,3 , Roland Wittler1,2,3 , and Jens Stoye1,2,3 1 3 Add to Reading List Source URL: www.techfak.uni-bielefeld.de Language: English - Date: 2015-06-29 08:16:32
93	VeriStream – A Framework for Verifiable Data Streaming Dominique Sch¨oder and Mark Simkin Saarland University Saarbr¨ ucken, Germany Add to Reading List Source URL: fc15.ifca.ai Language: English - Date: 2015-01-11 00:33:17 Hashing Cryptographic hash function Trie Merkle tree RSA B-tree
94	Attributing Authorship of Revisioned Content Luca de Alfaro ∗ Michael Shavlovsky Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 String searching algorithm Algorithm Symbol Trie
95	Poptrie: A Compressed Trie with Population Count for Fast and Scalable Software IP Routing Table Lookup – Public Review Luigi Rizzo Università di Pisa Pisa, Italy Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2015-07-29 16:42:17
96	Data Discovery and Dissemination with DIP tinyos-2.x/tos/lib/net/dip Kaisen Lin UC San Diego Add to Reading List Source URL: sing.stanford.edu Language: English - Date: 2014-11-10 18:30:10 Information retrieval Hashing Error detection and correction Information science Computer programming Cryptographic hash functions Search algorithms Distributed data storage Bloom filter Hash function Hash list Trie
97	Carnegie Mellon University Sparse Training Data Tutorial of Parameter Server Add to Reading List Source URL: www.mlss2014.com Language: English - Date: 2014-07-14 11:00:05 Sparse matrix Database index Matrix Mellon Data Trie Carnegie Computing Computer programming Software engineering
98	Fast And Space Efficient Trie Searches Phil Bagwell Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two have constant insert, search or delete Add to Reading List Source URL: idea.popcount.org Language: English
99	NOVUS X RIG Revolution Within The Institution RIG was arguably the last time planning was radical in the UK. Formed in the 1970s, the Radical Institute Group was a loose collective of young, politicised planners who trie Add to Reading List Source URL: commonoffice.co.uk Language: English - Date: 2014-08-21 06:20:05 Urban studies and planning Urban planner PAS Novus Royal Town Planning Institute Cliff Hague
100	Parallel De Bruijn Graph Construction and Traversal for De Novo Genome Assembly Evangelos Georganas†,‡ , Aydın Buluc¸† , Jarrod Chapman∗ Leonid Oliker† , Daniel Rokhsar∗,¶ , Katherine Yelick†,‡ Computa Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2014-09-08 14:12:54 Bioinformatics Biology Academia Computational biology Hashing K-mer Eulerian path Bloom filter Trie Parallel computing Hash table MurmurHash

UPDATE