Search results for "trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	Kalpathi R. Subramanian, Bruce F. Naylor	Converting Discrete Images to Partitioning Trees.	IEEE Trans. Vis. Comput. Graph.	1997	DBLP DOI BibTeX RDF	Partitioning trees, miltiresolution representations, MRI visualization, image reconstruction, image coding, scientific visualization, BSP trees, space partitioning
26	Yiorgos Chrysanthou, Mel Slater	Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes.	SI3D	1995	DBLP DOI BibTeX RDF	SVBSP Trees, dynamic modification, shadows, BSP Trees
26	Mee Yee Chan, Shiang-Jen Lee	Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	graph-theoretic question, simulation, computational complexity, NP-complete, hypercubes, hypercube networks, trees (mathematics), upper bound, complete binary trees, k-tree, fault tolerant embedding, fault tolerantcomputing
26	Qin Zhu	Goal trees and fault trees for root cause analysis.	ICSM	2008	DBLP DOI BibTeX RDF
26	Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup	Maintaining information in fully dynamic trees with top trees.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	Fully dynamic forest
26	Sai-cheong Ng, Kwong-Sak Leung	Induction of Linear Decision Trees with Real-Coded Genetic Algorithms and k-D Trees.	IDEAL	2005	DBLP DOI BibTeX RDF
26	Wen-Lian Hsu	PC-Trees vs. PQ-Trees.	COCOON	2001	DBLP DOI BibTeX RDF
26	Xiao Zhou 0001, Takao Nishizeki	Finding Independent Spanning Trees in Partial k-Trees.	ISAAC	2000	DBLP DOI BibTeX RDF
26	Leo Bachmair, Ta Chen, C. R. Ramakrishnan 0001, I. V. Ramakrishnan	Subsumption Algorithms Based on Search Trees.	CAAP	1996	DBLP DOI BibTeX RDF
26	Anucha Pitaksanonkul, Suchai Thanawastien, Chidchanok Lursinsap	Comparisons of quad trees and 4-D trees: new results [VLSI layout].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
26	Jürg Nievergelt	Trees as Data and File Structures.	CAAP	1981	DBLP DOI BibTeX RDF
25	Rodrigo C. Barros, Márcio P. Basgalupp, Duncan D. Ruiz, André Carlos Ponce de Leon Ferreira de Carvalho, Alex Alves Freitas	Evolutionary model tree induction.	SAC	2010	DBLP DOI BibTeX RDF	data mining, evolutionary algorithms, multi-objective optimisation, model trees
25	Pei-Pei Li 0001, Qianhui Liang, Xindong Wu 0001, Xuegang Hu	Parameter Estimdation in Semi-Random Decision Tree Ensembling on Streaming Data.	PAKDD	2009	DBLP DOI BibTeX RDF	data streams, parameter estimation, Random decision trees
25	Martin Walker, Leonardo Bottaci, Yiannis Papadopoulos	Compositional Temporal Fault Tree Analysis.	SAFECOMP	2007	DBLP DOI BibTeX RDF	temporal fault trees, formal FTA, automated FTA, fault tree synthesis, formal safety analysis
25	Tran Khanh Dang	Privacy-Preserving Search and Updates for Outsourced Tree-Structured Data on Untrusted Servers.	iTrust	2005	DBLP DOI BibTeX RDF	Outsourced search trees, data and user privacy, oblivious search and updates, encrypted data, untrusted servers
25	William A. Greene	Schema disruption in tree-structured chromosomes.	GECCO	2005	DBLP DOI BibTeX RDF	alternative chromosomes, schema disruption probability, genetic algorithms, trees, schema theory
25	Bryant A. Julstrom	The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.	GECCO	2005	DBLP DOI BibTeX RDF	blob code, edge-sets, routing cost, codings, spanning trees
25	Julio Mariño, José María Rey Poza	Adding constraints to curry via flat guards.	WCFLP	2005	DBLP DOI BibTeX RDF	definitional trees, sloth, constraints, type classes, curry
25	Alan Fern, Robert Givan	Online Ensemble Learning: An Empirical Study.	Mach. Learn.	2003	DBLP DOI BibTeX RDF	decision trees, boosting, online learning, branch prediction, ensemble learning, bagging
25	Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi	Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	Parallel algorithms, trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique
25	Dale Miller 0001	Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs.	CADE	1984	DBLP DOI BibTeX RDF	Expansion Trees, ET-proofs, Matings, Higher-order Logic, Natural Deduction
25	Gian Carlo Bongiovanni, C. K. Wong	Tree Search in Major/Minor Loop Magnetic Bubble Memories.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	major loops, minor loops, number of comparisons, one-sided height-balanced trees, one-sided K-height-balanced trees, record movement, Analysis of algorithms, insertion, deletion, tree search, balanced trees, magnetic bubble memories
25	Zhipeng Xie	Improved AdaBoost.M1 of decision trees with confidence-rated predictions.	SAC	2009	DBLP DOI BibTeX RDF	confidence-rated predictions, decision trees, AdaBoost
25	Elena Ikonomovska, João Gama 0001, Raquel Sebastião, Dejan Gjorgjevikj	Regression Trees from Data Streams with Drift Detection.	Discovery Science	2009	DBLP DOI BibTeX RDF	data stream, change detection, concept drift, regression trees, stream data mining
25	Joaquín Abellán, Andrés R. Masegosa	An Experimental Study about Simple Decision Trees for Bagging Ensemble on Datasets with Classification Noise.	ECSQARU	2009	DBLP DOI BibTeX RDF	credal sets, imprecise Dirichlet model, ensemble decision trees, classification, Imprecise probabilities, uncertainty measures
25	Amélie Gheerbrant, Balder ten Cate	Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees.	LFCS	2009	DBLP DOI BibTeX RDF	Fragments of MSO, Henkin semantics, Ehrenfeucht-Fraïssé games, Feferman-Vaught theorems, Trees, Axiomatizations
25	Joaquim Marques de Sá, João Gama 0001, Raquel Sebastião, Luís A. Alexandre	Decision Trees Using the Minimum Entropy-of-Error Principle.	CAIP	2009	DBLP DOI BibTeX RDF	entropy-of-error, node split criteria, decision trees
25	Weiyi Zhang 0001, Guoliang Xue, Jian Tang 0008, Krishnaiyan Thulasiraman	Faster algorithms for construction of recovery trees enhancing QoP and QoS.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	protection and restoration, quality of protection (QoP), redundant trees, quality of service (QoS), bottleneck bandwidth
25	Ohad Rodeh	B-trees, shadowing, and clones.	ACM Trans. Storage	2008	DBLP DOI BibTeX RDF	concurrency, Shadowing, b-trees, snapshots, copy-on-write
25	Anilu Franco-Arcega, Jesús Ariel Carrasco-Ochoa, Guillermo Sánchez-Díaz, José Francisco Martínez Trinidad	A New Incremental Algorithm for Induction of Multivariate Decision Trees for Large Datasets.	IDEAL	2008	DBLP DOI BibTeX RDF	Decision trees, supervised classification, large datasets
25	Tuhina Samanta, Prasun Ghosal, Hafizur Rahaman 0001, Parthasarathi Dasgupta	Revisiting fidelity: a case of elmore-based Y-routing trees.	SLIP	2008	DBLP DOI BibTeX RDF	routing, Steiner trees, fidelity, rank correlation
25	Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans	Agnostically learning decision trees.	STOC	2008	DBLP DOI BibTeX RDF	learning in the presence of noise, decision trees, agnostic learning
25	Philippe Lenca, Stéphane Lallich, Thanh-Nghi Do, Nguyen-Khang Pham	A Comparison of Different Off-Centered Entropies to Deal with Class Imbalance for Decision Trees.	PAKDD	2008	DBLP DOI BibTeX RDF	Off-centered entropies, Imbalance class, Decision trees, Shannon entropy
25	Xiaomeng Wang, Detlef D. Nauck, Martin Spott, Rudolf Kruse	Intelligent data analysis with fuzzy decision trees.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Fuzzy rule learning, Fuzzy decision trees, Classification models, Intelligent data analysis
25	Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth	Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees.	SAC	2007	DBLP DOI BibTeX RDF	CHR (Constraint Handling Rules), first-order constraints solving, theory of finite or infinite trees, Prolog, unification
25	Georg Gottlob, Christoph Koch 0001, Klaus U. Schulz	Conjunctive queries over trees.	J. ACM	2006	DBLP DOI BibTeX RDF	XML, Complexity, trees, expressiveness, conjunctive queries, succinctness
25	Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhisa Ueda, Minoru Kanehisa, Hiroshi Mamitsuka	A new efficient probabilistic model for mining labeled ordered trees.	KDD	2006	DBLP DOI BibTeX RDF	labeled ordered trees, probabilistic models, maximum likelihood, expectation - maximization
25	Yun Chi, Yi Xia, Yirong Yang, Richard R. Muntz	Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	closed frequent subtree, maximal frequent subtree, data mining, Trees, graph algorithms, mining methods and algorithms, frequent subtree
25	Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis	Scheduling trees with large communication delays on two identical processors.	J. Sched.	2005	DBLP DOI BibTeX RDF	two processors, scheduling, trees, makespan, communication delays
25	Cesar Gonzalez-Perez, Brian Henderson-Sellers, R. Geoff Dromey	A Metamodel for the Behavior Trees Modelling Technique.	ICITA (1)	2005	DBLP DOI BibTeX RDF	Requirements Engineering, Metamodel, Behavior Trees
25	Tran Trang, Nguyen Cam Chi, Vincel Hoang Ngoc Minh	Data Mining of Gene Expression Microarray via Weighted Prefix Trees.	PAKDD	2005	DBLP DOI BibTeX RDF	combinatoric of words, weighted trees, data mining, cluster analysis, DNA microarrays
25	Daniel H. Huson, Tobias Dezulian, Tobias H. Klöpper, Mike A. Steel	Phylogenetic Super-Networks from Partial Trees.	IEEE ACM Trans. Comput. Biol. Bioinform.	2004	DBLP DOI BibTeX RDF	partial trees, networks, closure operations, phylogeny, Molecular evolution
25	Daniel H. Huson, Tobias Dezulian, Tobias H. Klöpper, Mike A. Steel	Phylogenetic Super-networks from Partial Trees.	WABI	2004	DBLP DOI BibTeX RDF	partial trees, networks, closure operations, phylogeny, Molecular evolution
25	Soon Tee Teoh, Kwan-Liu Ma	PaintingClass: interactive construction, visualization and exploration of decision trees.	KDD	2003	DBLP DOI BibTeX RDF	classification, information visualization, decision trees, interactive visualization, visual data mining
25	Francesco De Comité, Rémi Gilleron, Marc Tommasi	Learning Multi-label Alternating Decision Trees from Texts and Data.	MLDM	2003	DBLP DOI BibTeX RDF	alternating decision trees, multi-label problems, text mining, boosting
25	Kai Ming Ting	An Instance-Weighting Method to Induce Cost-Sensitive Trees.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	greedy divide-and-conquer algorithm, instance weighting, decision trees, induction, Cost-sensitive
25	Michael Drmota	An Analytic Approach to the Height of Binary Search Trees.	Algorithmica	2001	DBLP DOI BibTeX RDF	Leftist trees, Generating functions, Asymptotic expansions
25	Bin Luo 0001, Antonio Robles-Kelly, Andrea Torsello, Richard C. Wilson 0001, Edwin R. Hancock	Discovering Shape Categories by Clustering Shock Trees.	CAIP	2001	DBLP DOI BibTeX RDF	clustering shock trees, Hamilton-Jacobi skeleton, EM algorithm
25	Trent Hill, James Noble 0001, John Potter	Scalable Visualisations with Ownership Trees.	TOOLS (37)	2000	DBLP DOI BibTeX RDF	program visualisation, scalable visualisations, ownership trees, top-level components, implicit aggregation structure, scale-independent topology, low-level data structure, software visualisation tool, learning, object-oriented programming, object-oriented programs, software maintenance, debugging, computer science education, teaching, program debugging, tree data structures, abstraction levels, object graph, program maintenance
25	Víctor M. Jiménez, Andrés Marzal	Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars.	SSPR/SPR	2000	DBLP DOI BibTeX RDF	Weighted Context-Free Grammars, CYK Algorithm, N Best Parse Trees, Stochastic Context-Free Grammars
25	Dimiter R. Avresky	Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	single and multiple faults, Fault tolerance, reconfiguration, spanning trees, faulty hypercubes
25	Gerassimos D. Barlas	Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Optimum load distribution, optimum distribution and collection sequencing, data-parallel applications, arbitrary processor trees, collection-aware load distribution
25	Ricardo A. Baeza-Yates, Joaquim Gabarró, Xavier Messeguer	Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees.	RANDOM	1998	DBLP DOI BibTeX RDF	Fringe analysis, 2-3 trees, Binomial trans- form, Parallel algorithms
25	Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano	Multiple Templates Access of Trees in Parallel Memory Systems.	IPPS	1997	DBLP DOI BibTeX RDF	multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems
25	Lech Józwiak	On the use of term trees for effective and efficient test pattern generation.	EUROMICRO	1997	DBLP DOI BibTeX RDF	term trees, structural automatic test pattern generation, fault discovery, structural fault model, term tree based ATPG algorithm, nonredundant faults, minimal test set, circuit redundancy, logic design, fault model, data representation, automatic test software
25	Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau	Embeddings of complete binary trees into star graphs with congestion 1.	HICSS (2)	1995	DBLP DOI BibTeX RDF	complete binary tree embeddings, vertex congestion, graph height, binary tree architecture, parallel architectures, multiprocessor interconnection networks, trees (mathematics), dilation, star graphs, algorithm simulation
25	Rolf Klein, Derick Wood	The Node Visit Cost of Brother Trees.	WG	1986	DBLP DOI BibTeX RDF	Key-words brother trees, node visit cost, worst case cost
24	Stefan Grünewald, Vincent Moulton	Maximum Parsimony for Tree Mixtures.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	Applications, Biology and genetics
24	Xiaotie Deng, Jie Zhang 0008	Equiseparability on Terminal Wiener Index.	AAIM	2009	DBLP DOI BibTeX RDF	Equiseparability, terminal Wiener index, chemical tree
24	Jijun Cao, Jinshu Su, Chunqing Wu	Modeling and Analyzing the Instantaneous Stability for Application Layer Multicast.	APSCC	2008	DBLP DOI BibTeX RDF
24	Dong Kyue Kim, Heejin Park	A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.	CPM	2005	DBLP DOI BibTeX RDF
24	Gonzalo Ramos-Jiménez, José del Campo-Ávila, Rafael Morales Bueno	E-CIDIM: Ensemble of CIDIM Classifiers.	ADMA	2005	DBLP DOI BibTeX RDF
24	Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa	A Conjecture on Wiener Indices in Combinatorial Chemistry.	Algorithmica	2004	DBLP DOI BibTeX RDF	Wiener index, Combinatorial chemistry, Graph theory, Matrix searching
24	Dennis E. Shasha, Jason Tsong-Li Wang, Sen Zhang	Unordered Tree Mining with Applications to Phylogeny.	ICDE	2004	DBLP DOI BibTeX RDF
24	Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi	Learnability and Automatizability.	FOCS	2004	DBLP DOI BibTeX RDF
24	Hongjun Zhu, Jianwen Su, Oscar H. Ibarra	Trajectory queries and octagons in moving object databases.	CIKM	2002	DBLP DOI BibTeX RDF
24	Helger Lipmaa	On Optimal Hash Tree Traversal for Interval Time-Stamping.	ISC	2002	DBLP DOI BibTeX RDF	interval time-stamping, Laplace's method for integrals, Analysis of algorithms, tree traversal, implementation complexity
24	Yusuke Suzuki, Ryuta Akanuma, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida	Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data.	COLT	2002	DBLP DOI BibTeX RDF
24	Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan 0001	On the sorting-complexity of suffix tree construction.	J. ACM	2000	DBLP DOI BibTeX RDF	DAM model, RAM model, sorting complexity, suffix tree, suffix array, external-memory data structures
24	V. Michele Abrusci, Christophe Fouqueré, Jacqueline Vauzeilles	Tree Adjoining Grammars in Noncommutative Linear Logic.	LACL	1996	DBLP DOI BibTeX RDF
24	Derick Wood	Extremal Cost Tree Data Structures.	SWAT	1988	DBLP DOI BibTeX RDF
24	Christos Faloutsos, Timos K. Sellis, Nick Roussopoulos	Analysis of Object Oriented Spatial Access Methods.	SIGMOD Conference	1987	DBLP DOI BibTeX RDF
23	Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao 0001	Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.	CPM	2006	DBLP DOI BibTeX RDF	intersection problem, multi-labeled trees, conjunctive queries, succinct data structures, labeled trees
23	Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer	Relaxed Balance Using Standard Rotations.	Algorithmica	2001	DBLP DOI BibTeX RDF	Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis
23	Karl R. P. H. Leung, Wai Wong	Deriving test cases using class vectors.	APSEC	2000	DBLP DOI BibTeX RDF	software test case derivation, class vectors, human decision-making, vector partitions, formal specification, formal specifications, program testing, pattern classification, vectors, trees (mathematics), tree structure, expressive power, classification trees, Cartesian product
23	Liming Wei, Deborah Estrin	Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics.	ICCCN	1995	DBLP DOI BibTeX RDF	protocol independent multicast, dense mode operations, sparse mode operations, overhead tradeoffs, cross-over point, group density metric, multicast routing, telecommunication network routing, packet losses, simulation study, shortest path trees, shared trees, data packets
23	Paraskevi Fragopoulou, Selim G. Akl	Fault tolerant communication algorithms on the star network using disjoint paths.	HICSS (2)	1995	DBLP DOI BibTeX RDF	fault-tolerant communication algorithms, node pairs, directed edge-disjoint spanning trees, single-node broadcasting, multinode broadcasting, single-node scattering problem, all-port communication assumption, faulty edges, multinode scattering problem, interconnection networks, fault tolerant computing, broadcasting, graph, multiprocessor interconnection networks, trees (mathematics), disjoint paths, star network, message transmission, faulty nodes
23	Antonia Bertolino, Martina Marré	Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers
23	Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing	Time-Optimal Tree Computations on Sparse Meshes.	WG	1994	DBLP DOI BibTeX RDF	meshes with multiple broadcasting, traversais, tree reconstruction, parentheses algorithms, encoding, decoding, binary trees, ordered trees
23	Sabine R. Öhring, Sajal K. Das 0001	Embeddings of Tree-Related Networks in Incomplete Hypercubes.	PARLE	1993	DBLP DOI BibTeX RDF	shuffle-trees, Interconnection networks, graph embeddings, pyramids, mesh of trees, incomplete hypercubes
23	Nick Roussopoulos, Christos Faloutsos, Timos K. Sellis	An Efficient Pictorial Database System for PSQL.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	pictorial database system, PSQL, alphanumeric encodings, R/sup trees, multidimensional B-trees, user interfaces, data structures, data structures, database management systems, query language, query languages, spatial search, spatial objects
23	Pierre Fraigniaud, Andrzej Pelc	Delays induce an exponential memory gap for rendezvous in trees.	SPAA	2010	DBLP DOI BibTeX RDF	mobile entities, robots, exploration, abstract state machine, rendezvous
23	Christophe Marsala	Data mining with ensembles of fuzzy decision trees.	CIDM	2009	DBLP DOI BibTeX RDF
23	Ellips Masehian, Azadeh Hassan Nejad	Solvability of multi robot motion planning problems on Trees.	IROS	2009	DBLP DOI BibTeX RDF
23	Yun Li 0010, Xin Guo, Yunhao Yuan, Jia Wu, Ling Chen 0005	An Efficient Algorithm to Mine Unordered Trees.	ACIS-ICIS	2009	DBLP DOI BibTeX RDF
23	Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi	The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer.	POPL	2009	DBLP DOI BibTeX RDF	huet's zippers, polynomial data structures, the third homomorphism theorem, divide-and-conquer
23	Nicolas Broutin, Luc Devroye, Erin McLeish	Weighted height of random trees.	Acta Informatica	2008	DBLP DOI BibTeX RDF
23	Zhiheng Huang, Tamás D. Gedeon, Masoud Nikravesh	Pattern Trees Induction: A New Machine Learning Method.	IEEE Trans. Fuzzy Syst.	2008	DBLP DOI BibTeX RDF
23	Prosenjit Bose, Karim Douïeb, Stefan Langerman	Dynamic optimality for skip lists and B-trees.	SODA	2008	DBLP BibTeX RDF
23	J. Gordon Burleigh, Mukul S. Bansal, André Wehe, Oliver Eulenstein	Locating Multiple Gene Duplications through Reconciled Trees.	RECOMB	2008	DBLP DOI BibTeX RDF
23	Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne	Efficient synthesis of compressor trees on FPGAs.	ASP-DAC	2008	DBLP DOI BibTeX RDF
23	Riku Saikkonen, Eljas Soisalon-Soininen	Cache-sensitive Memory Layout for Binary Trees.	IFIP TCS	2008	DBLP DOI BibTeX RDF
23	Lixuan Lu, Jin Jiang 0001	Joint Failure Importance for Noncoherent Fault Trees.	IEEE Trans. Reliab.	2007	DBLP DOI BibTeX RDF
23	Amos Korman	General compact labeling schemes for dynamic trees.	Distributed Comput.	2007	DBLP DOI BibTeX RDF	Distributed algorithms, Dynamic networks, Labeling schemes, Routing schemes
23	Eli Brosh, Asaf Levin, Yuval Shavitt	Approximation and heuristic algorithms for minimum-delay application-layer multicast trees.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	approximation algorithms, overlay networks, peer-to-peer communications
23	Kunihiko Sadakane	Compressed Suffix Trees with Full Functionality.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
23	Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung	Ultra-succinct representation of ordered trees.	SODA	2007	DBLP BibTeX RDF
23	Keeley A. Crockett, Zuhair Bandar, David McLean 0001	On the Optimization of T-norm parameters within Fuzzy Decision Trees.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
23	Ming Fu, Yu Zhang 0086	Homomorphism Resolving of XPath Trees Based on Automata.	APWeb/WAIM	2007	DBLP DOI BibTeX RDF	XPath tree, automata, containment, homomorphism
23	Jelena Pjesivac-Grbovic, George Bosilca, Graham E. Fagg, Thara Angskun, Jack J. Dongarra	Decision Trees and MPI Collective Algorithm Selection Problem.	Euro-Par	2007	DBLP DOI BibTeX RDF