The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for trie with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1982 (16) 1983-1989 (17) 1990-1995 (18) 1996-1998 (20) 1999-2001 (24) 2002 (19) 2003 (18) 2004 (24) 2005 (36) 2006 (41) 2007 (43) 2008 (25) 2009 (18) 2010 (15) 2011-2012 (35) 2013-2014 (29) 2015 (17) 2016-2017 (23) 2018 (16) 2019 (17) 2020-2021 (30) 2022-2023 (30) 2024 (5)
Publication types (Num. hits)
article(194) incollection(2) inproceedings(336) phdthesis(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 305 occurrences of 212 keywords

Results
Found 536 publication records. Showing 536 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
138Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski Summary Structures for Frequency Queries on Large Transaction Sets. Search on Bibsonomy Data Compression Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Frequency Queries, Patricia Tries, Compressed Tries, Compression, Transactions, Tries, Frequent Sets
137Douglas Comer Heuristics for Trie Index Minimization. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF doubly chained tree, trie minimization, index, trie
126Cheng-Wen Cheng, Jonas Rabin Synthesis of Decision Rules. Search on Bibsonomy Commun. ACM The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
118Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong Trie Hashing With Controlled Load. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF primary key access method, dynamic files, key search, trie hashing, controlled load, THCL, TH file, B-tree file, high load factor, ordered insertions, random insertions, trees (mathematics), file organisation, information retrieval systems, load factor, load factor, disk access
99Guy Louchard Trie Size in a Dynamic List Structure. Search on Bibsonomy TAPSOFT The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
95B. John Oommen, Ghada Hany Badr Breadth-first search strategies for trie-based syntactic pattern recognition. Search on Bibsonomy Pattern Anal. Appl. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Approximate string matching
87Seunghyun Oh, Yangsun Lee 0002 The Bitmap Trie for Fast Prefix Lookup. Search on Bibsonomy Human.Society@Internet 2003 The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
87R. Ramesh 0002, A. J. G. Babu, J. Peter Kincaid Variable-Depth Trie Index Optimization: Theory and Experimental Results. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
84Ghada Badr, B. John Oommen A novel look-ahead optimization strategy for trie-based approximate string matching. Search on Bibsonomy Pattern Anal. Appl. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Branch and bound techniques, Pruning, Approximate string matching
80Douglas Comer Analysis of a Heuristic for Trie Minimization. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF trie index, trie size, heuristic
76Bo Zheng, Chuang Lin 0002 AM-Trie: A High-Speed Parallel Packet Classification Algorithm for Network Processor. Search on Bibsonomy International Conference on Computational Science (4) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
76Bo Zheng, Chuang Lin 0002, Xuehai Peng AM-Trie: An OC-192 Parallel Multidimensional Packet Classification Algorithm. Search on Bibsonomy IMSCCS (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
76Robert W. P. Luk Time-Space Trade-Off Analysis of Morphic Trie Images. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
76M. Al-Suwaiyel, Ellis Horowitz Algorithms for Trie Compaction. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
69Sailesh Kumar, Michela Becchi, Patrick Crowley, Jonathan S. Turner CAMP: fast and efficient IP lookup architecture. Search on Bibsonomy ANCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF IP lookup, longest prefix match, internet router
65Nikolas Askitis, Justin Zobel B-tries for disk-based string management. Search on Bibsonomy VLDB J. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Burst trie, Vocabulary accumulation, Word-level indexing, Data structures, B-tree, Secondary storage
65Sartaj Sahni, Kun Suk Kim Efficient construction of multibit tries for IP lookup. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF multibit trie, dynamic programming, packet routing, longest matching prefix, controlled prefix expansion
64Meifang Li, Hongkai Zhu, Derong Shen, Tiezheng Nie, Yue Kou, Ge Yu 0001 Pampoo: An Efficient Skip-Trie Based Query Processing Framework for P2P Systems. Search on Bibsonomy APPT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
64Errin W. Fulp, Stephen J. Tarsa Trie-Based Policy Representations for Network Firewalls. Search on Bibsonomy ISCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
64Witold Litwin, Djamel Eddine Zegour, Gérard Lévy Multilevel Trie Hashing. Search on Bibsonomy EDBT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
62Chien-Huei Chen Lexicon-driven word recognition. Search on Bibsonomy ICDAR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF lexicon-driven word recognition, document understanding systems, trie data structures, word image recognition, lexicon trie searching, node characters, segmentation-free method, character hypothesis verification, severely degraded images, document image processing, best match
61Ye-In Chang, Jiun-Rung Chen, Min-Tze Hsu A Hash Trie Filter Approach to Approximate String Matching for Genomic Databases. Search on Bibsonomy IEA/AIE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF hash trie, filter, Approximate string matching
57David Y. Chen, Jianchang Mao, K. Moidin Mohiuddin An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph. Search on Bibsonomy ICDAR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
57Arne Andersson, Stefan Nilsson Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. Search on Bibsonomy ESA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
54Hyesook Lim, Ju Hyoung Mun High-speed packet classification using binary search on length. Search on Bibsonomy ANCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF area-based quad-trie, best matching rule, binary search on length, hashing, packet classification
54Hai Zhuge, Xiaoping Sun, Jie Liu 0025, Erlin Yao, Xue Chen A Scalable P2P Platform for the Knowledge Grid. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF distributed trie index, Peer-to-peer, load balancing, replication, knowledge grid, path query, semantic overlay
53Moritz G. Maaß Average-Case Analysis of Approximate Trie Search. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
53Stephen J. Tarsa, Errin W. Fulp Balancing Trie-Based Policy Representations for Network Firewalls. Search on Bibsonomy ISCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
53Ghada Badr, B. John Oommen Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies. Search on Bibsonomy ICAPR (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
53Ghada Badr, B. John Oommen A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching. Search on Bibsonomy CORES The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
53Moritz G. Maaß Average-Case Analysis of Approximate Trie Search (Extended Abstract). Search on Bibsonomy CPM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
53Michael J. Freedman, Radek Vingralek Efficient Peer-to-Peer Lookup Based on a Distributed Trie. Search on Bibsonomy IPTPS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
49Levent Guner, Pinar Senkul Frequent Itemset Minning with Trie Data Structure and Parallel Execution with PVM. Search on Bibsonomy PVM/MPI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Message Passing, PVM, Parallel Execution, Apriori, Trie
49Walter A. Burkhard Hashing and Trie Algorithms for Partial Match Retrieval. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF trie search, algorithms, searching, analysis, retrieval, partial match, hash coding, associative retrieval
46Haibin Lu, Sartaj Sahni O(logW) multidimensional packet classification. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF binary search on levels, expected complexity, multidimensional packet classification
46Zhenguo Shi, Zongtian Liu, Qiang Wu Research on au-Parameter Fuzzy Concept Lattice for Grid Resource. Search on Bibsonomy SKG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Mahmoud Youssef, Vijayalakshmi Atluri, Nabil R. Adam Preserving mobile customer privacy: an access control system for moving objects and customer profiles. Search on Bibsonomy Mobile Data Management The full citation details ... 2005 DBLP  DOI  BibTeX  RDF privacy, mobile, access control, moving objects, customer profiles
46Haoyu Song 0001, Jonathan S. Turner, John W. Lockwood Shape Shifting Tries for Faster IP Route Lookup. Search on Bibsonomy ICNP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
46Naresh Neelapala, Romil Mittal, Jayant R. Haritsa SPINE: Putting Backbone into String Indexing. Search on Bibsonomy ICDE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
46Linhui Jiang, Howard J. Hamilton Methods for Mining Frequent Sequential Patterns. Search on Bibsonomy AI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Steffen Heinz, Justin Zobel, Hugh E. Williams Burst tries: a fast, efficient data structure for string keys. Search on Bibsonomy ACM Trans. Inf. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF string data structures, vocabulary accumulation, Binary trees, text databases, tries, splay trees
42Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi Factor Oracles. Search on Bibsonomy CIAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF factor oracle, suffix trie, graph quotient, string matching, suffix tree
42Xin Zhou, Yunlong Xu, Gongming Chen, Zhigeng Pan A New Wildcard Search Method for Digital Dictionary Based on Mobile Platform. Search on Bibsonomy ICAT Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Trie tree, No-head wildcard, Cut-branch, Mobile phone, Wildcard
41Jorge Costa, João Raimundo, Ricardo Rocha 0001 A Term-Based Global Trie for Tabled Logic Programs. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Table Space, Implementation, Tabling Logic Programming
41B. Kalpana, R. Nadarajan, J. Senthil Babu An Indexed Trie Approach to Incremental Mining of Closed Frequent Itemsets Based on a Galois Lattice Framework. Search on Bibsonomy DASFAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink Rotamer-Pair Energy Calculations Using a Trie Data Structure. Search on Bibsonomy WABI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Anurag Acharya 0001, Huican Zhu, Kai Shen Adaptive Algorithms for Cache-Efficient Trie Search. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
41Pilar de la Torre, David T. Kao A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. Search on Bibsonomy MFCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
41Walid G. Aref, Daniel Barbará, Padmavathi Vallabhaneni The Handwritten Trie: Indexing Electronic Ink. Search on Bibsonomy SIGMOD Conference The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
41Philippe Jacquet, Mireille Régnier Trie Partitioning Process: Limiting Distributions. Search on Bibsonomy CAAP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
39Hyesook Lim, Changhoon Yim, Earl E. Swartzlander Jr. Priority Tries for IP Address Lookup. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2010 DBLP  DOI  BibTeX  RDF binary trie, priority trie, range representation, Internet, router, IP address lookup
38Vanessa El-Khoury, Nadia Bennani, Aris M. Ouksel Distributed Key Management in Dynamic Outsourced Databases: A Trie-Based Approach. Search on Bibsonomy DBKDA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Binary Trie, Access control, Outsourcing
38Kun Suk Kim, Sartaj Sahni Efficient Construction of Pipelined Multibit-Trie Router-Tables. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multibit trie, pipelined router-table, dynamic programming, Packet routing, longest matching-prefix, controlled prefix expansion
38Jun-ichi Aoe, Katsushi Morimoto, Masami Shishibori, Ki-Hong Park A Trie Compaction Algorithm for a Large Set of Keys. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Key search techniques, trie structures, digital search, key retrieval algorithm, natural language dictionaries, data structure
37Jae-Yun Kim, Junmo Lee, Soo-Mook Moon Trie-Hashimoto: State Trie-Based Proof-of-Work Mining for Optimizing Blockchain Storage. Search on Bibsonomy IEEE Access The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
37Kaushal Kumar Maurya, Maunendra Sankar Desarkar, Manish Gupta 0001, Puneet Agrawal trie-nlg: trie context augmentation to improve personalized query auto-completion for short and unseen prefixes. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
37Kaushal Kumar Maurya, Maunendra Sankar Desarkar, Manish Gupta 0001, Puneet Agrawal Trie-NLG: Trie Context Augmentation to Improve Personalized Query Auto-Completion for Short and Unseen Prefixes. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
37Yi Zhang, Lufeng Qiao, Huali Wang PR-Trie: A Hybrid Trie with Ant Colony Optimization Based Prefix Partitioning for Memory-Efficient IPv4/IPv6 Route Lookup. Search on Bibsonomy IEICE Trans. Inf. Syst. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
37Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu 0001, Charles McGuffey, Phillip B. Gibbons PIM-trie: A Skew-resistant Trie for Processing-in-Memory. Search on Bibsonomy SPAA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
37Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda c-trie++: A dynamic trie tailored for fast prefix searches. Search on Bibsonomy Inf. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
37Md Iftakharul Islam, Javed I. Khan CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC. Search on Bibsonomy HPSR The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
37Rahat Yeasin Emon, Sharmistha Chanda Tista A Compact Radix-Trie: A Character-Cell Compressed Trie Data-Structure for Word-Lookup System. Search on Bibsonomy ICO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
37Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. Search on Bibsonomy DCC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
37Jianlin Shi, John F. Hurdle Trie-based rule processing for clinical NLP: A use-case study of n-trie, making the ConText algorithm more efficient and scalable. Search on Bibsonomy J. Biomed. Informatics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
37Jianhua Feng, Jiannan Wang 0001, Guoliang Li 0001 Trie-join: a trie-based method for efficient string similarity joins. Search on Bibsonomy VLDB J. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
37Jiannan Wang 0001, Guoliang Li 0001, Jianhua Feng Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints. (PDF / PS) Search on Bibsonomy Proc. VLDB Endow. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal Trie Based Subsumption and Improving the pi-Trie Algorithm. Search on Bibsonomy PAAR@IJCAR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Nikolas Askitis, Ranjan Sinha HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. Search on Bibsonomy ACSC The full citation details ... 2007 DBLP  BibTeX  RDF
37Masami Shishibori, Makoto Okada, Toru Sumitomo, Jun-ichi Aoe An Efficient Trie Hashing Method Using a Compact Binary Trie. Search on Bibsonomy Stringology The full citation details ... 1997 DBLP  BibTeX  RDF
34Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva g-tries: an efficient data structure for discovering network motifs. Search on Bibsonomy SAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF algorithms, data structures, complex networks, graph mining, biological networks, tries, network motifs
34Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal Prime Implicate Tries. Search on Bibsonomy TABLEAUX The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
34Neil V. Murray, Erik Rosenthal Reduced Implicate/Implicant Tries. Search on Bibsonomy ISMIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Ranjan Sinha, Anthony Wirth Engineering Burstsort: Towards Fast In-Place String Sorting. Search on Bibsonomy WEA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Xuhui Liu, Guoliang Li 0001, Jianhua Feng, Lizhu Zhou Effective Indices for Efficient Approximate String Search and Similarity Join. Search on Bibsonomy WAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski Profile of Tries. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Svante Janson, Wojciech Szpankowski Partial fillup and search time in LC tries. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization
34John Yiannis, Justin Zobel Compression techniques for fast external sorting. Search on Bibsonomy VLDB J. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Semi-static compression, Sorting, Query evaluation, External sorting
34Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim A Practical Method for Approximate Subsequence Search in DNA Databases. Search on Bibsonomy PAKDD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF DNA database, approximate subsequence search, suffix tree
34Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Kaushik Rajan, Ramaswamy Govindarajan Two-level mapping based cache index selection for packet forwarding engines. Search on Bibsonomy PACT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF network processors, cache architectures
34Gerth Stølting Brodal, Rolf Fagerberg Cache-oblivious string dictionaries. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Eddy Caron, Frederic Desprez, Charles Fourdrignier, Franck Petit, Cédric Tedeschi A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems. Search on Bibsonomy HiPC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34GaHyun Park, Wojciech Szpankowski Towards a complete characterization of tries. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
34Kaushik Rajan, Ramaswamy Govindarajan A heterogeneously segmented cache architecture for a packet forwarding engine. Search on Bibsonomy ICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Heuiseok Lim, Kichun Nam, Yumi Hwang A Computational Model of Korean Mental Lexicon. Search on Bibsonomy ICCSA (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Hao Xuefeng, Xu De LMIX: A Dynamic XML Index Method Using Line Model. Search on Bibsonomy APWeb The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski Do We Really Need to Balance Patricia Trees? (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
31Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C. V. Jawahar Example based video filters. Search on Bibsonomy CIVR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF video filtering, vocabulary trie, copy detection, indexing and retrieval
31Pawel Terlecki, Krzysztof Walczak 0002 Attribute Set Dependence in Reduct Computation. Search on Bibsonomy Trans. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF set dependence, rough sets, reduct, apriori, trie
31Martin Fiala, Jan Holub 0001 DCA Using Suffix Arrays. Search on Bibsonomy DCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Data Compression using Antidictionaries, suffix trie, suffix array
31Neil V. Murray, Erik Rosenthal Efficient Query Processing with Reduced Implicate Tries. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF reduced implicate trie, query processing, knowledge base
31Sartaj Sahni, Kun Suk Kim Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. Search on Bibsonomy SAINT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
31Sartaj Sahni, Kun Suk Kim Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. Search on Bibsonomy FTDCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
31Sriganesh Madhvanath, Venu Krpasundar Pruning Large Lexicons Using Generalized Word Shape Descriptors. Search on Bibsonomy ICDAR The full citation details ... 1997 DBLP  DOI  BibTeX  RDF static lexicon organization, lexicon reduction, holistic matching, trie organization, shape descriptors, Handwritten word recognition, postprocessing, elastic matching
31Steven Dawson, C. R. Ramakrishnan 0001, Steven Skiena, Terrance Swift Principles and Practice of Unification Factoring. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF trie minimization, logic programming, indexing, unification
30Yuqing Wu, Sofia Brenes, Hyungdae Yi Workload-aware trie indices for XML. Search on Bibsonomy CIKM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF structural index, query processing, xml, workload
30Jeahyun Park, Juyoung Park, Joongmin Choi Web-Based Document Classification Using a Trie-Based Index Structure. Search on Bibsonomy Web Intelligence/IAT Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Rui Camacho, Nuno A. Fonseca, Ricardo Rocha 0001, Vítor Santos Costa ILP : - Just Trie It. Search on Bibsonomy ILP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mode Directed Inverse Entailment, Data Structures, Efficiency
30Manolis Terrovitis, Spyros Passas, Panos Vassiliadis, Timos K. Sellis A combination of trie-trees and inverted files for the indexing of set-valued attributes. Search on Bibsonomy CIKM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF HTI, containment queries, inverted files, tries
30Rosalba Giugno, Alfredo Pulvirenti, Diego Reforgiato Recupero Clustered Trie Structures for Approximate Search in Hierarchical Objects Collections. Search on Bibsonomy ICAPR (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 536 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license