|
|
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 |
138 | Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski |
Summary Structures for Frequency Queries on Large Transaction Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: Data Compression Conference, DCC 2000, Snowbird, Utah, USA, March 28-30, 2000., pp. 420-429, 2000, IEEE Computer Society, 0-7695-0592-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Frequency Queries, Patricia Tries, Compressed Tries, Compression, Transactions, Tries, Frequent Sets |
137 | Douglas Comer |
Heuristics for Trie Index Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 4(3), pp. 383-395, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
doubly chained tree, trie minimization, index, trie |
126 | Cheng-Wen Cheng, Jonas Rabin |
Synthesis of Decision Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 19(7), pp. 404-406, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
118 | Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong |
Trie Hashing With Controlled Load. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 17(7), pp. 678-691, 1991. The full citation details ...](Pics/full.jpeg) |
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 |
99 | Guy Louchard |
Trie Size in a Dynamic List Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings, pp. 717-731, 1993, Springer, 3-540-56610-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
95 | B. John Oommen, Ghada Hany Badr |
Breadth-first search strategies for trie-based syntactic pattern recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 10(1), pp. 1-13, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Approximate string matching |
87 | Seunghyun Oh, Yangsun Lee 0002 |
The Bitmap Trie for Fast Prefix Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Human.Society@Internet 2003 ![In: Web Communication Technologies and Internet-Related Social Issues - HSI 2003, Second International Conference on Human Society@Internet, Seoul, Korea, June 18-20, 2003, Proceedings, pp. 566-575, 2003, Springer, 3-540-40456-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
87 | R. Ramesh 0002, A. J. G. Babu, J. Peter Kincaid |
Variable-Depth Trie Index Optimization: Theory and Experimental Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 14(1), pp. 41-74, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
84 | Ghada Badr, B. John Oommen |
A novel look-ahead optimization strategy for trie-based approximate string matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 9(2-3), pp. 177-187, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Branch and bound techniques, Pruning, Approximate string matching |
80 | Douglas Comer |
Analysis of a Heuristic for Trie Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 6(3), pp. 513-537, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
trie index, trie size, heuristic |
76 | Bo Zheng, Chuang Lin 0002 |
AM-Trie: A High-Speed Parallel Packet Classification Algorithm for Network Processor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (4) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part IV, pp. 41-48, 2006, Springer, 3-540-34385-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
76 | Bo Zheng, Chuang Lin 0002, Xuehai Peng |
AM-Trie: An OC-192 Parallel Multidimensional Packet Classification Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (1) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 1, pp. 377-384, 2006, IEEE Computer Society, 0-7695-2581-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
76 | Robert W. P. Luk |
Time-Space Trade-Off Analysis of Morphic Trie Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 13(6), pp. 1028-1032, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
76 | M. Al-Suwaiyel, Ellis Horowitz |
Algorithms for Trie Compaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 9(2), pp. 243-263, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
69 | Sailesh Kumar, Michela Becchi, Patrick Crowley, Jonathan S. Turner |
CAMP: fast and efficient IP lookup architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2006 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2006, San Jose, California, USA, December 3-5, 2006, pp. 51-60, 2006, ACM, 1-59593-580-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
IP lookup, longest prefix match, internet router |
65 | Nikolas Askitis, Justin Zobel |
B-tries for disk-based string management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 18(1), pp. 157-179, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Burst trie, Vocabulary accumulation, Word-level indexing, Data structures, B-tree, Secondary storage |
65 | Sartaj Sahni, Kun Suk Kim |
Efficient construction of multibit tries for IP lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 11(4), pp. 650-662, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multibit trie, dynamic programming, packet routing, longest matching prefix, controlled prefix expansion |
64 | Meifang 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](Pics/bibsonomy.png) |
APPT ![In: Advanced Parallel Processing Technologies, 7th International Symposium, APPT 2007, Guangzhou, China, November 22-23, 2007, Proceedings, pp. 190-198, 2007, Springer, 978-3-540-76836-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
64 | Errin W. Fulp, Stephen J. Tarsa |
Trie-Based Policy Representations for Network Firewalls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 27-30 June 2005, Murcia, Cartagena, Spain, pp. 434-441, 2005, IEEE Computer Society, 0-7695-2373-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
64 | Witold Litwin, Djamel Eddine Zegour, Gérard Lévy |
Multilevel Trie Hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT'88, Proceedings of the International Conference on Extending Database Technology, Venice, Italy, March 14-18, 1988, pp. 309-335, 1988, Springer, 3-540-19074-0. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
62 | Chien-Huei Chen |
Lexicon-driven word recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 919-922, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
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 |
61 | Ye-In Chang, Jiun-Rung Chen, Min-Tze Hsu |
A Hash Trie Filter Approach to Approximate String Matching for Genomic Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Next-Generation Applied Intelligence, 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2009, Tainan, Taiwan, June 24-27, 2009. Proceedings, pp. 816-825, 2009, Springer, 978-3-642-02567-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hash trie, filter, Approximate string matching |
57 | David Y. Chen, Jianchang Mao, K. Moidin Mohiuddin |
An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Fifth International Conference on Document Analysis and Recognition, ICDAR 1999, 20-22 September, 1999, Bangalore, India, pp. 543-546, 1999, IEEE Computer Society, 0-7695-0318-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
57 | Arne Andersson, Stefan Nilsson |
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 82-93, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
54 | Hyesook Lim, Ju Hyoung Mun |
High-speed packet classification using binary search on length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2007 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2007, Orlando, Florida, USA, December 3-4, 2007, pp. 137-144, 2007, ACM, 978-1-59593-945-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
area-based quad-trie, best matching rule, binary search on length, hashing, packet classification |
54 | Hai Zhuge, Xiaoping Sun, Jie Liu 0025, Erlin Yao, Xue Chen |
A Scalable P2P Platform for the Knowledge Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(12), pp. 1721-1736, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
distributed trie index, Peer-to-peer, load balancing, replication, knowledge grid, path query, semantic overlay |
53 | Moritz G. Maaß |
Average-Case Analysis of Approximate Trie Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(3-4), pp. 469-491, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Stephen J. Tarsa, Errin W. Fulp |
Balancing Trie-Based Policy Representations for Network Firewalls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 26-29 June 2006, Cagliari, Sardinia, Italy, pp. 755-760, 2006, IEEE Computer Society, 0-7695-2588-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Ghada Badr, B. John Oommen |
Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPR (1) ![In: Pattern Recognition and Data Mining, Third International Conference on Advances in Pattern Recognition, ICAPR 2005, Bath, UK, August 22-25, 2005, Proceedings, Part I, pp. 1-17, 2005, Springer, 3-540-28757-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Ghada Badr, B. John Oommen |
A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CORES ![In: Computer Recognition Systems, Proceedings of the 4th International Conference on Computer Recognition Systems, CORES'05, May 22-25, 2005, Rydzyna Castle, Poland, pp. 87-94, 2005, Springer, 978-3-540-25054-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Moritz G. Maaß |
Average-Case Analysis of Approximate Trie Search (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 472-484, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
53 | Michael J. Freedman, Radek Vingralek |
Efficient Peer-to-Peer Lookup Based on a Distributed Trie. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPTPS ![In: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7-8, 2002, Revised Papers, pp. 66-75, 2002, Springer, 3-540-44179-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Levent Guner, Pinar Senkul |
Frequent Itemset Minning with Trie Data Structure and Parallel Execution with PVM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM/MPI User's Group Meeting, Paris, France, September 30 - October 3, 2007, Proceedings, pp. 289-296, 2007, Springer, 978-3-540-75415-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Message Passing, PVM, Parallel Execution, Apriori, Trie |
49 | Walter A. Burkhard |
Hashing and Trie Algorithms for Partial Match Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 1(2), pp. 175-187, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
trie search, algorithms, searching, analysis, retrieval, partial match, hash coding, associative retrieval |
46 | Haibin Lu, Sartaj Sahni |
O(logW) multidimensional packet classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(2), pp. 462-472, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
binary search on levels, expected complexity, multidimensional packet classification |
46 | Zhenguo Shi, Zongtian Liu, Qiang Wu |
Research on au-Parameter Fuzzy Concept Lattice for Grid Resource. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SKG ![In: 2006 International Conference on Semantics, Knowledge and Grid (SKG 2006), 1-3 November 2006, Guilin, China, pp. 16, 2006, IEEE Computer Society, 0-7695-2673-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
46 | Mahmoud Youssef, Vijayalakshmi Atluri, Nabil R. Adam |
Preserving mobile customer privacy: an access control system for moving objects and customer profiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mobile Data Management ![In: 6th International Conference on Mobile Data Management (MDM 2005), Ayia Napa, Cyprus, May 9-13, 2005, pp. 67-76, 2005, ACM, 1-59593-041-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
privacy, mobile, access control, moving objects, customer profiles |
46 | Haoyu Song 0001, Jonathan S. Turner, John W. Lockwood |
Shape Shifting Tries for Faster IP Route Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 13th IEEE International Conference on Network Protocols (ICNP 2005), 6-9 November 2005, Boston, MA, USA, pp. 358-367, 2005, IEEE Computer Society, 0-7695-2437-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Naresh Neelapala, Romil Mittal, Jayant R. Haritsa |
SPINE: Putting Backbone into String Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA, pp. 325-336, 2004, IEEE Computer Society, 0-7695-2065-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
46 | Linhui Jiang, Howard J. Hamilton |
Methods for Mining Frequent Sequential Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003, Halifax, Canada, June 11-13, 2003, Proceedings, pp. 486-491, 2003, Springer, 3-540-40300-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Steffen Heinz, Justin Zobel, Hugh E. Williams |
Burst tries: a fast, efficient data structure for string keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. ![In: ACM Trans. Inf. Syst. 20(2), pp. 192-223, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
string data structures, vocabulary accumulation, Binary trees, text databases, tries, splay trees |
42 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi |
Factor Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 78-89, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
factor oracle, suffix trie, graph quotient, string matching, suffix tree |
42 | Xin Zhou, Yunlong Xu, Gongming Chen, Zhigeng Pan |
A New Wildcard Search Method for Digital Dictionary Based on Mobile Platform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAT Workshops ![In: 16th International Conference on Artificial Reality and Telexistence, ICAT 2006, Hangzhou, China, November 29 - December 1, 2006, Workshops Proceedings, pp. 699-704, 2006, IEEE Computer Society, 0-7695-2754-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Trie tree, No-head wildcard, Cut-branch, Mobile phone, Wildcard |
41 | Jorge Costa, João Raimundo, Ricardo Rocha 0001 |
A Term-Based Global Trie for Tabled Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings, pp. 205-219, 2009, Springer, 978-3-642-02845-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Table Space, Implementation, Tabling Logic Programming |
41 | B. 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](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 13th International Conference, DASFAA 2008, New Delhi, India, March 19-21, 2008. Proceedings, pp. 486-495, 2008, Springer, 978-3-540-78567-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink |
Rotamer-Pair Energy Calculations Using a Trie Data Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 389-400, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Anurag Acharya 0001, Huican Zhu, Kai Shen |
Adaptive Algorithms for Cache-Efficient Trie Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers, pp. 296-311, 1999, Springer, 3-540-66227-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
41 | Pilar 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](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, pp. 542-553, 1996, Springer, 3-540-61550-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
41 | Walid G. Aref, Daniel Barbará, Padmavathi Vallabhaneni |
The Handwritten Trie: Indexing Electronic Ink. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, USA, May 22-25, 1995., pp. 151-162, 1995, ACM Press, 978-0-89791-731-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
41 | Philippe Jacquet, Mireille Régnier |
Trie Partitioning Process: Limiting Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '86, 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, Proceedings, pp. 196-210, 1986, Springer, 3-540-16443-X. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
39 | Hyesook Lim, Changhoon Yim, Earl E. Swartzlander Jr. |
Priority Tries for IP Address Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 59(6), pp. 784-794, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
binary trie, priority trie, range representation, Internet, router, IP address lookup |
38 | Vanessa El-Khoury, Nadia Bennani, Aris M. Ouksel |
Distributed Key Management in Dynamic Outsourced Databases: A Trie-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBKDA ![In: The First International Conference on Advances in Databases, Knowledge, and Data Applications, DBKDS 2009, Gosier, Guadeloupe, France, 1-6 March 2009, pp. 56-61, 2009, IEEE Computer Society, 978-0-7695-3550-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Binary Trie, Access control, Outsourcing |
38 | Kun Suk Kim, Sartaj Sahni |
Efficient Construction of Pipelined Multibit-Trie Router-Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(1), pp. 32-43, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multibit trie, pipelined router-table, dynamic programming, Packet routing, longest matching-prefix, controlled prefix expansion |
38 | Jun-ichi Aoe, Katsushi Morimoto, Masami Shishibori, Ki-Hong Park |
A Trie Compaction Algorithm for a Large Set of Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 8(3), pp. 476-491, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Key search techniques, trie structures, digital search, key retrieval algorithm, natural language dictionaries, data structure |
37 | Jae-Yun Kim, Junmo Lee, Soo-Mook Moon |
Trie-Hashimoto: State Trie-Based Proof-of-Work Mining for Optimizing Blockchain Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 12, pp. 18315-18329, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
37 | Kaushal 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](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 37(6), pp. 2306-2329, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
37 | Kaushal 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.15455, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
37 | Yi 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](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 106(4), pp. 509-522, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
37 | Hongbo 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](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023, pp. 1-14, 2023, ACM, 978-1-4503-9545-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
37 | Kazuya 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](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 285(Part), pp. 104794, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
37 | Md Iftakharul Islam, Javed I. Khan |
CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPSR ![In: 22nd IEEE International Conference on High Performance Switching and Routing, HPSR 2021, Paris, France, June 7-10, 2021, pp. 1-8, 2021, IEEE, 978-1-6654-4005-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
37 | Rahat Yeasin Emon, Sharmistha Chanda Tista |
A Compact Radix-Trie: A Character-Cell Compressed Trie Data-Structure for Word-Lookup System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICO ![In: ICO, pp. 440-449, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
37 | Kazuya 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](Pics/bibsonomy.png) |
DCC ![In: Data Compression Conference, DCC 2020, Snowbird, UT, USA, March 24-27, 2020, pp. 243-252, 2020, IEEE, 978-1-7281-6457-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
37 | Jianlin 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](Pics/bibsonomy.png) |
J. Biomed. Informatics ![In: J. Biomed. Informatics 85, pp. 106-113, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
37 | Jianhua Feng, Jiannan Wang 0001, Guoliang Li 0001 |
Trie-join: a trie-based method for efficient string similarity joins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 21(4), pp. 437-461, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
37 | Jiannan Wang 0001, Guoliang Li 0001, Jianhua Feng |
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 3(1), pp. 1219-1230, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
37 | Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal |
Trie Based Subsumption and Improving the pi-Trie Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAAR@IJCAR ![In: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, PAAR-2010, Edinburgh, Scotland, UK, July 14, 2010, pp. 74-83, 2010, EasyChair. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
37 | Nikolas Askitis, Ranjan Sinha |
HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSC ![In: Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30 - February 2, 2007. Proceedings, pp. 97-105, 2007, Australian Computer Society, 1-920-68243-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
37 | Masami Shishibori, Makoto Okada, Toru Sumitomo, Jun-ichi Aoe |
An Efficient Trie Hashing Method Using a Compact Binary Trie. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stringology ![In: Proceedings of the Prague Stringology Club Workshop 1997, Prague, Czech Republic, July 7, 1997, pp. 1-11, 1997, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
34 | Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva |
g-tries: an efficient data structure for discovering network motifs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1559-1566, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
algorithms, data structures, complex networks, graph mining, biological networks, tries, network motifs |
34 | Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal |
Prime Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings, pp. 250-264, 2009, Springer, 978-3-642-02715-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Neil V. Murray, Erik Rosenthal |
Reduced Implicate/Implicant Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 17th International Symposium, ISMIS 2008, Toronto, Canada, May 20-23, 2008, Proceedings, pp. 203-214, 2008, Springer, 978-3-540-68122-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Ranjan Sinha, Anthony Wirth |
Engineering Burstsort: Towards Fast In-Place String Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings, pp. 14-27, 2008, Springer, 978-3-540-68548-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Xuhui Liu, Guoliang Li 0001, Jianhua Feng, Lizhu Zhou |
Effective Indices for Efficient Approximate String Search and Similarity Join. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: The Ninth International Conference on Web-Age Information Management, WAIM 2008, July 20-22, 2008, Zhangjiajie, China, pp. 127-134, 2008, IEEE Computer Society, 978-0-7695-3185-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski |
Profile of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 1-11, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Svante Janson, Wojciech Szpankowski |
Partial fillup and search time in LC tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 44, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization |
34 | John Yiannis, Justin Zobel |
Compression techniques for fast external sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 16(2), pp. 269-291, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Semi-static compression, Sorting, Query evaluation, External sorting |
34 | Jung-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](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007, Nanjing, China, May 22-25, 2007, Proceedings, pp. 921-931, 2007, Springer, 978-3-540-71700-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
DNA database, approximate subsequence search, suffix tree |
34 | Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 424-435, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Kaushik Rajan, Ramaswamy Govindarajan |
Two-level mapping based cache index selection for packet forwarding engines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACT ![In: 15th International Conference on Parallel Architectures and Compilation Techniques (PACT 2006), Seattle, Washington, USA, September 16-20, 2006, pp. 212-221, 2006, ACM, 1-59593-264-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
network processors, cache architectures |
34 | Gerth Stølting Brodal, Rolf Fagerberg |
Cache-oblivious string dictionaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 581-590, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Eddy 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](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2006, 13th International Conference, Bangalore, India, December 18-21, 2006, Proceedings, pp. 171-182, 2006, Springer, 3-540-68039-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | GaHyun Park, Wojciech Szpankowski |
Towards a complete characterization of tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 33-42, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
34 | Kaushik Rajan, Ramaswamy Govindarajan |
A heterogeneously segmented cache architecture for a packet forwarding engine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 19th Annual International Conference on Supercomputing, ICS 2005, Cambridge, Massachusetts, USA, June 20-22, 2005, pp. 71-80, 2005, ACM, 1-59593-167-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Heuiseok Lim, Kichun Nam, Yumi Hwang |
A Computational Model of Korean Mental Lexicon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part I, pp. 1129-1134, 2005, Springer, 3-540-25860-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Hao Xuefeng, Xu De |
LMIX: A Dynamic XML Index Method Using Line Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Web Technologies Research and Development - APWeb 2005, 7th Asia-Pacific Web Conference, Shanghai, China, March 29 - April 1, 2005, Proceedings, pp. 253-265, 2005, Springer, 3-540-25207-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski |
Do We Really Need to Balance Patricia Trees? (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 302-316, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
31 | Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C. V. Jawahar |
Example based video filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIVR ![In: Proceedings of the 8th ACM International Conference on Image and Video Retrieval, CIVR 2009, Santorini Island, Greece, July 8-10, 2009, 2009, ACM, 978-1-60558-480-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
video filtering, vocabulary trie, copy detection, indexing and retrieval |
31 | Pawel Terlecki, Krzysztof Walczak 0002 |
Attribute Set Dependence in Reduct Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Comput. Sci. ![In: Transactions on Computational Science II, pp. 118-132, 2008, Springer, 978-3-540-87562-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
set dependence, rough sets, reduct, apriori, trie |
31 | Martin Fiala, Jan Holub 0001 |
DCA Using Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2008 Data Compression Conference (DCC 2008), 25-27 March 2008, Snowbird, UT, USA, pp. 516, 2008, IEEE Computer Society, 978-0-7695-3121-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Data Compression using Antidictionaries, suffix trie, suffix array |
31 | Neil V. Murray, Erik Rosenthal |
Efficient Query Processing with Reduced Implicate Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 38(1-3), pp. 155-172, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
reduced implicate trie, query processing, knowledge base |
31 | Sartaj Sahni, Kun Suk Kim |
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAINT ![In: 2002 Symposium on Applications and the Internet (SAINT 2002), 28 January - 1 February 2002, Nara City, Japan, Proceedings, pp. 220-229, 2002, IEEE Computer Society, 0-7695-1447-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion |
31 | Sartaj Sahni, Kun Suk Kim |
Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTDCS ![In: 8th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS 2001), 31 October, 2 November 2001, Bologna, Italy, Proceedings, pp. 178-184, 2001, IEEE Computer Society, 0-7695-1384-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion |
31 | Sriganesh Madhvanath, Venu Krpasundar |
Pruning Large Lexicons Using Generalized Word Shape Descriptors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 4th International Conference Document Analysis and Recognition (ICDAR '97), 2-Volume Set, August 18-20, 1997, Ulm, Germany, Proceedings, pp. 552-555, 1997, IEEE Computer Society, 0-8186-7898-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
static lexicon organization, lexicon reduction, holistic matching, trie organization, shape descriptors, Handwritten word recognition, postprocessing, elastic matching |
31 | Steven Dawson, C. R. Ramakrishnan 0001, Steven Skiena, Terrance Swift |
Principles and Practice of Unification Factoring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 18(5), pp. 528-563, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
trie minimization, logic programming, indexing, unification |
30 | Yuqing Wu, Sofia Brenes, Hyungdae Yi |
Workload-aware trie indices for XML. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 1425-1428, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
structural index, query processing, xml, workload |
30 | Jeahyun Park, Juyoung Park, Joongmin Choi |
Web-Based Document Classification Using a Trie-Based Index Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Web Intelligence/IAT Workshops ![In: Proceedings of the 2007 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology - Workshops, 2-5 November 2007, Silicon Valley, CA, USA, pp. 52-55, 2007, IEEE Computer Society, 0-7695-3028-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Rui Camacho, Nuno A. Fonseca, Ricardo Rocha 0001, Vítor Santos Costa |
ILP : - Just Trie It. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 17th International Conference, ILP 2007, Corvallis, OR, USA, June 19-21, 2007, Revised Selected Papers, pp. 78-87, 2007, Springer, 978-3-540-78468-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mode Directed Inverse Entailment, Data Structures, Efficiency |
30 | Manolis 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](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, Virginia, USA, November 6-11, 2006, pp. 728-737, 2006, ACM, 1-59593-433-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
HTI, containment queries, inverted files, tries |
30 | Rosalba Giugno, Alfredo Pulvirenti, Diego Reforgiato Recupero |
Clustered Trie Structures for Approximate Search in Hierarchical Objects Collections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPR (1) ![In: Pattern Recognition and Data Mining, Third International Conference on Advances in Pattern Recognition, ICAPR 2005, Bath, UK, August 22-25, 2005, Proceedings, Part I, pp. 63-70, 2005, Springer, 3-540-28757-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 536 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|