Search results for "tries"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Svante Janson, Wojciech Szpankowski	Partial fillup and search time in LC tries	CoRR	2005	DBLP BibTeX RDF
19	Carmen Anido, Carlos Rivero, Teófilo Valdés	An algorithm based on discrete response regression models suitable to correct the bias of non-response in surveys with several capture tries.	Eur. J. Oper. Res.	2005	DBLP DOI BibTeX RDF
19	Luc Devroye, Wojciech Szpankowski	Probabilistic behavior of asymmetric level compressed tries.	Random Struct. Algorithms	2005	DBLP DOI BibTeX RDF
19	Ghada Hany Badr, B. John Oommen	Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics.	Comput. J.	2005	DBLP DOI BibTeX RDF
19	Ghada Badr, B. John Oommen	On using conditional rotations and randomized heuristics for self-organizing ternary search tries.	ACM Southeast Regional Conference (1)	2005	DBLP DOI BibTeX RDF
19	Bradford G. Nickerson, Qingxiu Shi	Approximate Orthogonal Range Search using Patricia Tries.	CCCG	2005	DBLP BibTeX RDF
19	Yuriy A. Reznik	On the Average Density and Selectivity of Nodes in Multi-Digit Tries.	ALENEX/ANALCO	2005	DBLP BibTeX RDF
19	Sartaj Sahni	Tries.	Handbook of Data Structures and Applications	2004	DBLP DOI BibTeX RDF
19	Werner Schachinger	Concentration of Size and Path Length of Tries.	Comb. Probab. Comput.	2004	DBLP DOI BibTeX RDF
19	Ranjan Sinha, Justin Zobel	Cache-conscious sorting of large sets of strings with dynamic tries.	ACM J. Exp. Algorithmics	2004	DBLP DOI BibTeX RDF
19	Charles Knessl, Wojciech Szpankowski	On the number of full levels in tries.	Random Struct. Algorithms	2004	DBLP DOI BibTeX RDF
19	Werner Schachinger	Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
19	Ranjan Sinha, Justin Zobel	Using Random Sampling to Build Approximate Tries for Efficient String Sorting.	WEA	2004	DBLP DOI BibTeX RDF
19	Ranjan Sinha	Using Compact Tries for Cache-Efficient Sorting of Integers.	WEA	2004	DBLP DOI BibTeX RDF
19	Bradford G. Nickerson, Qingxiu Shi	Tries for combined text and spatial data range search.	CCCG	2004	DBLP BibTeX RDF
19	Helmut Prodinger	Compositions and Patricia Tries: No Fluctuations in the Variance!	ALENEX/ANALC	2004	DBLP BibTeX RDF
19	B. John Oommen, Ghada Badr	Dictionary-Based Syntactic Pattern Recognition Using Tries.	SSPR/SPR	2004	DBLP DOI BibTeX RDF
19	Linda Dailey Paulson	News Briefs Topics Include: Researchers Automate the Digital Animation Process New / Compression Technology Would Improve Online Video Quality / Sun Tries to Guide Mobile Java.	Computer	2003	DBLP DOI BibTeX RDF
19	Anand Sarda, Arunabha Sen	A memory-efficient scheme for address lookup using compact prefix tries.	GLOBECOM	2003	DBLP DOI BibTeX RDF
19	Lingke Bu, Bradford G. Nickerson	Multidimensional Orthogonal Range Search Using Tries.	CCCG	2003	DBLP BibTeX RDF
19	Andrea Pietracaprina, Dario Zandolin	Mining Frequent Itemsets using Patricia Tries.	FIMI	2003	DBLP BibTeX RDF
19	Ranjan Sinha, Justin Zobel	Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries.	ALENEX	2003	DBLP BibTeX RDF
19	Markus E. Nebel	The Stack-Size of Combinatorial Tries Revisited.	Discret. Math. Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
19	Stefan Nilsson, Matti Tikkanen	An Experimental Study of Compression Methods for Dynamic Tries.	Algorithmica	2002	DBLP DOI BibTeX RDF
19	Markus E. Nebel	The stack-size of tries: a combinatorial study.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
19	Yuriy A. Reznik	Some results on tries with adaptive branching.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
19	Charles Knessl, Wojciech Szpankowski	Limit laws for the height in PATRICIA tries.	J. Algorithms	2002	DBLP DOI BibTeX RDF
19	Ramanujan S. Kashi, Winston Nelson	Signature verification: benefits of multiple tries.	IWFHR	2002	DBLP DOI BibTeX RDF
19	Linda Dailey Paulson	Translation Technology Tries to Hurdle the Language Barrier.	Computer	2001	DBLP DOI BibTeX RDF
19	Jérémie Bourdon, Markus E. Nebel, Brigitte Vallée	On the Stack-Size of General Tries.	RAIRO Theor. Informatics Appl.	2001	DBLP DOI BibTeX RDF
19	Jérémie Bourdon	Size and path length of Patricia tries: Dynamical sources context.	Random Struct. Algorithms	2001	DBLP DOI BibTeX RDF
19	Luc Devroye	Analysis of random LC tries.	Random Struct. Algorithms	2001	DBLP DOI BibTeX RDF
19	Masao Fuketa, Masaki Oono, Kazuhiro Morita, Jun-ichi Aoe	On the construction of reduced double array structures by dividing tries.	SMC	2001	DBLP DOI BibTeX RDF
19	Charles Knessl, Wojciech Szpankowski	A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large.	Electron. J. Comb.	2000	DBLP DOI BibTeX RDF
19	Markus E. Nebel	On the Horton-Strahler number for combinatorial tries.	RAIRO Theor. Informatics Appl.	2000	DBLP DOI BibTeX RDF
19	Werner Schachinger	Limiting distributions for the costs of partial match retrievals in multidimensional tries.	Random Struct. Algorithms	2000	DBLP DOI BibTeX RDF
19	Ralf Hinze	Generalizing generalized tries.	J. Funct. Program.	2000	DBLP DOI BibTeX RDF
19	Thomas Andreae, Felix Hartenstein, Andrea Wolter	A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men.	Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
19	Stefan Nilsson, Gunnar Karlsson	IP-address lookup using LC-tries.	IEEE J. Sel. Areas Commun.	1999	DBLP DOI BibTeX RDF
19	Strahil Ristov, Éric Laporte 0001	Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays.	CPM	1999	DBLP DOI BibTeX RDF
19	Andrew Berman, Linda G. Shapiro	Triangle-inequality-based pruning algorithms with triangle tries.	Storage and Retrieval for Image and Video Databases (SPIE)	1999	DBLP DOI BibTeX RDF
19	Ricardo A. Baeza-Yates, Gaston H. Gonnet	Fast Text Searching for Regular Expressions or Automaton Searching on Tries.	J. ACM	1996	DBLP DOI BibTeX RDF
19	Heping Shang, T. H. Merrett	Tries for Approximate String Matching.	IEEE Trans. Knowl. Data Eng.	1996	DBLP DOI BibTeX RDF
19	Luc Devroye, Paul Kruszewski	On the Horton-Strahler Number for Random Tries.	RAIRO Theor. Informatics Appl.	1996	DBLP DOI BibTeX RDF
19	T. H. Merrett, Heping Shang, Xiaoyan Zhao	Database Structures, Based on Tries, for Text, Spatial, and General Data.	CODAS	1996	DBLP BibTeX RDF
19	Chih-Long Lin	Optimizing TRIEs for Ordered Pattern Matching is PiP2-Complete.	SCT	1995	DBLP DOI BibTeX RDF
19	Arne Andersson, Stefan Nilsson	Improved Behaviour of Tries by Adaptive Branching.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
19	Bonita Rais, Philippe Jacquet, Wojciech Szpankowski	Limiting Distribution for the Depth in Patricia Tries.	SIAM J. Discret. Math.	1993	DBLP DOI BibTeX RDF
19	Lorraine K. D. Cooper, Alan L. Tharp	Multi-character Tries for Text Searching.	Inf. Process. Manag.	1993	DBLP DOI BibTeX RDF
19	Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski	Multidimensional Digital Searching and Some New Parameters in Tries.	Int. J. Found. Comput. Sci.	1993	DBLP DOI BibTeX RDF
19	Arne Andersson	Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint".	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
19	Pierre Nicodème	Compact Balanced Tries.	IFIP Congress (1)	1992	DBLP BibTeX RDF
19	Andreas Dengel 0001, Adolf Pleyer, Rainer Hoch	Fragmentary string matching by selective access to hybrid tries.	ICPR (2)	1992	DBLP DOI BibTeX RDF
19	Philippe Jacquet, Wojciech Szpankowski	Analysis of digital tries with Markovian dependency.	IEEE Trans. Inf. Theory	1991	DBLP DOI BibTeX RDF
19	John A. Dundas III	Implementing Dynamic Minimal-prefix Tries.	Softw. Pract. Exp.	1991	DBLP DOI BibTeX RDF
19	Philippe Jacquet, Wojciech Szpankowski	What Can We Learn about Suffix Trees from Independent Tries?	WADS	1991	DBLP DOI BibTeX RDF
19	Tong-Bi Pei, Charles A. Zukowski	VLSI Implementation of Routing Tables: Tries and CAMs.	INFOCOM	1991	DBLP DOI BibTeX RDF
19	Jean-Philippe Thirion	Tries: Data Structures based on Binary Representation for Ray Tracing.	Eurographics	1990	DBLP DOI BibTeX RDF
19	Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski	On the Balance Property of Patricia Tries: External Path Length Viewpoint.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF
19	Mireille Régnier, Philippe Jacquet	New results on the size of tries.	IEEE Trans. Inf. Theory	1989	DBLP DOI BibTeX RDF
19	Wojciech Szpankowski	Some Results on V-ary Asymmetric Tries.	J. Algorithms	1988	DBLP DOI BibTeX RDF
19	Philippe Jacquet, Mireille Régnier	Normal Limiting Distribution of the Size of Tries.	Performance	1987	DBLP BibTeX RDF
19	Luc Devroye	A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort.	Acta Informatica	1984	DBLP DOI BibTeX RDF
19	Douglas Comer	Effects of Updates on Optimality in Tries.	J. Comput. Syst. Sci.	1983	DBLP DOI BibTeX RDF
19	Jack A. Orenstein	Multidimensional Tries Used for Associative Searching.	Inf. Process. Lett.	1982	DBLP DOI BibTeX RDF
19	Luc Devroye	A note on the average depth of tries.	Computing	1982	DBLP DOI BibTeX RDF
19	Markku Tamminen	Order Preserving Extendible Hashing and Bucket Tries.	BIT	1981	DBLP DOI BibTeX RDF
19	Douglas Comer	Extracting unique rows of a bounded degree array using tries.	AFIPS National Computer Conference	1980	DBLP DOI BibTeX RDF
19	David Kahn	Nuggets from the Archives: Yardley Tries Again.	Cryptologia	1978	DBLP DOI BibTeX RDF
19	B. M. Nicklas, Gunter Schlageter	Index Structuring in Inverted Data Bases by TRIES.	Comput. J.	1977	DBLP DOI BibTeX RDF
19	Kurt Maly	Compressed Tries.	Commun. ACM	1976	DBLP DOI BibTeX RDF
18	Jorge Costa, Ricardo Rocha 0001	One Table Fits All.	PADL	2009	DBLP DOI BibTeX RDF	Table Space, Implementation, Tabling Logic Programming
18	Haoyu Song 0001, Murali S. Kodialam, Fang Hao, T. V. Lakshman	Scalable IP Lookups using Shape Graphs.	ICNP	2009	DBLP DOI BibTeX RDF
18	Jorge Costa, Ricardo Rocha 0001	Global Storing Mechanisms for Tabled Evaluation.	ICLP	2008	DBLP DOI BibTeX RDF
18	Kun Suk Kim, Sartaj Sahni	Efficient Construction of Pipelined Multibit-Trie Router-Tables.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	multibit trie, pipelined router-table, dynamic programming, Packet routing, longest matching-prefix, controlled prefix expansion
18	Barry W. Boehm	A view of 20th and 21st century software engineering.	ICSE	2006	DBLP DOI BibTeX RDF	software futures, software history, software engineering
18	Ji-Hyeon Kim, Yun Jin, Yeo-Jung Kim, Ji-Hoon Kang	An Extended Planning Mechanism to Increase Web Service Utilization.	APWeb	2005	DBLP DOI BibTeX RDF
18	Samer Sa'adah, Peter Ross, Ben Paechter	Improving Vehicle Routing Using a Customer Waiting Time Colony.	EvoCOP	2004	DBLP DOI BibTeX RDF
18	Joong Chae Na, Kunsoo Park	Simple Implementation of String B-Trees..	SPIRE	2004	DBLP DOI BibTeX RDF
18	Yasuhiko Kitamura, Akira Iida, Keunsik Park	Micro View and Macro View Approaches to Discovered Rule Filtering.	Active Mining	2003	DBLP DOI BibTeX RDF
18	Hans Leiß, Michel de Rougemont	Automata on Lempel-ziv Compressed Strings.	CSL	2003	DBLP DOI BibTeX RDF
18	Philippe Flajolet, Claude Puech	Partial match retrieval of multidimensional data.	J. ACM	1986	DBLP DOI BibTeX RDF
18	Douglas Comer	Heuristics for Trie Index Minimization.	ACM Trans. Database Syst.	1979	DBLP DOI BibTeX RDF	doubly chained tree, trie minimization, index, trie
12	Chuancong Gao, Jianyong Wang 0001	Direct mining of discriminative patterns for classifying uncertain data.	KDD	2010	DBLP DOI BibTeX RDF	expected confidence, frequent pattern mining, uncertain data, associative classification
12	Irfan Ahmed 0002, Mugen Peng, Wenbo Wang 0007, Syed Ismail Shah	Performance analysis of a random ARQ initialized cooperative communication protocol in shadowed Nakagami-m wireless channel.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	cooperative transmit diversity, composite shadowed fading channel, wireless networks, automatic repeat request (ARQ)
12	Vo Gia Loc, Se-gon Roh, Igmo Koo, Duc Trong Tran, Ho Moon Kim, Hyungpil Moon, Hyouk Ryeol Choi, Sangdeok Park	Control of a quadruped robot with enhanced adaptability over unstructured terrain.	IROS	2009	DBLP DOI BibTeX RDF
12	Jérôme Leroux	The General Vector Addition System Reachability Problem by Presburger Inductive Invariants.	LICS	2009	DBLP DOI BibTeX RDF
12	Nicolas Broutin, Luc Devroye, Erin McLeish	Weighted height of random trees.	Acta Informatica	2008	DBLP DOI BibTeX RDF
12	Mohammad Behdadfar, Hossein Saidi 0001	The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree.	Networking	2008	DBLP DOI BibTeX RDF	LMP, LPM, insert, delete, lookup, SMV
12	Eray Gençay, Carsten Sinz, Wolfgang Küchlin	Towards SLA-based optimal workload distribution in SANs.	NOMS	2008	DBLP DOI BibTeX RDF
12	Stéphane Genaud, Choopan Rattanapoka	Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI.	IPDPS	2008	DBLP DOI BibTeX RDF
12	Christoph Burghardt, Christiane Reisse, Thomas Heider, Martin Giersich, Thomas Kirste	Implementing Scenarios in a Smart Learning Environment.	PerCom	2008	DBLP DOI BibTeX RDF	intention analysis, display assignment, pervasive learning, smart rooms
12	Majed Ayyad	e-government informatics.	ICEGOV	2008	DBLP DOI BibTeX RDF	e-government informatics, e-government patterns, multidisciplinary systems, reusable knowledge
12	Ye Cao, Weili Han, Yueran Le	Anti-phishing based on automated individual white-list.	Digital Identity Management	2008	DBLP DOI BibTeX RDF	anti-pharming, individual white-list, login user interface, na?ve bayesian classifier, anti-phishing
12	Juan Antonio Castillo, Antonio Manuel Ortiz, Vicente López 0001, Teresa Olivares, Luis Orozco-Barbosa	WiseObserver: a real experience with wireless sensor networks.	PM2HW2N	2008	DBLP DOI BibTeX RDF	wireless sensor network visualization tool, software development, data analysis
12	Marco Rotonda, Massimiliano Petri	New Cycle-Lane Project: A Participative Approach.	ICCSA (1)	2008	DBLP DOI BibTeX RDF	Cycle-Lane Project, Decision Trees, Participation, Web-GIS
12	Dongbing Gu, Erfu Yang	Fuzzy Policy Reinforcement Learning in Cooperative Multi-robot Systems.	J. Intell. Robotic Syst.	2007	DBLP DOI BibTeX RDF	flocking behavior, policy gradient reinforcement learning, cooperative control, multi-agent reinforcement learning
12	Hyo Yol Park, Jae Won Kang, Kwang Soon Kim, Keum-Chan Whang	Efficient Puncturing Method for Rate-Compatible Low-Density Parity-Check Codes.	IEEE Trans. Wirel. Commun.	2007	DBLP DOI BibTeX RDF
12	Zhe Wang 0002, Songcan Chen	New Least Squares Support Vector Machines Based on Matrix Patterns.	Neural Process. Lett.	2007	DBLP DOI BibTeX RDF	Fuzzy least squares support vector machine (FLS-SVM), Vector pattern, Matrix pattern, Pattern recognition, Support vector machine (SVM), Least squares support vector machine (LS-SVM)
12	Shyue-Liang Wang, Dipen Patel, Ayat Jafari, Tzung-Pei Hong	Hiding collaborative recommendation association rules.	Appl. Intell.	2007	DBLP DOI BibTeX RDF	Association rule, Privacy preserving data mining, Collaborative recommendation