Search results for "trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
8	William E. Wright	Dynamic Binary Search Trees.	ACM Annual Conference	1978	DBLP DOI BibTeX RDF	BB trees, Dynamic trees, Optimal trees, Weighted path length, Weighted trees, Binary search trees, AVL trees
7	Karel Culik II, Thomas Ottmann, Derick Wood	Dense Multiway Trees.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	dense trees, multiway trees, storage utilization, B-trees, search trees, balanced trees
5	YunMei Dong	Linear algorithm for lexicographic enumeration of CFG parse trees.	Science in China Series F: Information Sciences	2009	DBLP DOI BibTeX RDF	hierarchical construction of set of parse trees, lexicographic enumeration of parse trees, counting of parse trees
5	David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao	Representing Trees of Higher Degree.	Algorithmica	2005	DBLP DOI BibTeX RDF	Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures
5	Marc Mosko, J. J. Garcia-Luna-Aceves	An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees. (PDF / PS)	ICNP	2000	DBLP DOI BibTeX RDF	packet loss correlation, FEC-enhanced multicast trees, group loss probabilities, forward error correction codes, state equations, recursive formulae, FEC group, shared loss tree, leaf nodes, transmission group, missing packets, nonuniform link loss, nonFEC trees, Internet, probability, error correction codes, packet switching, decoding, decoding, trees (mathematics), forward error correction, multicast communication, erasure codes, correlation methods, probability mass function, cumulative distribution function
5	Floriana Esposito, Donato Malerba, Giovanni Semeraro	A Comparative Analysis of Methods for Pruning Decision Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	1997	DBLP DOI BibTeX RDF	top-down induction of decision trees, simplification of decision trees, pruning and grafting operators, optimal pruning, Decision trees, comparative studies
5	Joaquim Gabarró, Xavier Messeguer, Daniel Riu	Concurrent Rebalancing on HyperRed-Black Trees. (PDF / PS)	SCCC	1997	DBLP DOI BibTeX RDF	concurrent rebalancing, HyperRed-Black trees, consecutive red nodes, Chromatic trees, red nodes, concurrent deletions algorithm, concurrent insertions, direct updating, red cluster, trees (mathematics), deletions
5	Jason Cong, Cheng-Kok Koh	Interconnect layout optimization under higher-order RLC model.	ICCAD	1997	DBLP DOI BibTeX RDF	RATS trees, Steiner routings, bounded-radius Steiner trees, higher-order RLC model, incremental moment computation algorithm, interconnect layout optimization, nonmonotone signal response, required-arrival-time Steiner trees, resistance-inductance-capacitance circuits, routing area, routing cost, routing topologies, shortest-path Steiner trees, signal delay, signal settling time, voltage overshoot, waveform optimization, waveform quality evaluation, wire-sizing optimization, circuit optimisation, topology optimization, delay optimization
5	Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang	The emulation problem on trees. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	emulation problem, optimal emulation, X-trees, m-ary trees, parallel algorithms, parallel algorithms, interconnection networks, multiprocessor interconnection networks, trees, pyramids
5	Eiichi Tanaka	A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees
4	Rajen B. Bhatt, M. Gopal	FRCT: fuzzy-rough classification trees.	Pattern Anal. Appl.	2008	DBLP DOI BibTeX RDF	Fuzzy-rough classification trees, Classification, Rough sets, Decision trees, Fuzzy sets, Fuzzy-rough sets
4	Jakub Koperwas, Krzysztof Walczak 0002	Frequent Subsplit Representation of Leaf-Labelled Trees.	EvoBIO	2008	DBLP DOI BibTeX RDF	Leaf-labelled trees, frequent subsplits, phylogenetic trees
4	Jakub Koperwas, Krzysztof Walczak 0002	Phylogenetic Trees Dissimilarity Measure Based on Strict Frequent Splits Set and Its Application for Clustering.	RSKT	2008	DBLP DOI BibTeX RDF	Leaf-labelled trees, Frequent subsplits, Clustering, Phylogenetic trees
4	Christophe Marsala, Marcin Detyniecki	High scale video mining with forests of fuzzy decision trees.	CSTST	2008	DBLP DOI BibTeX RDF	forest of fuzzy decision trees, TRECVid, fuzzy decision trees, video mining
4	Andreas Brandstädt, Van Bang Le, R. Sritharan	Structure and linear-time recognition of 4-leaf powers.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	squares of trees, trees, phylogenetic trees, leaf powers, Graph powers
4	Antonio Corral, Manuel Torres, Michael Vassilakopoulos, Yannis Manolopoulos	Predictive Join Processing between Regions and Moving Objects.	ADBIS	2008	DBLP DOI BibTeX RDF	TPR-trees, linear quad-trees, query processing, Moving objects, R-trees, joins
4	Michael Benedikt, Leonid Libkin, Frank Neven	Logical definability and query languages over ranked and unranked trees.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	Ranked trees, unranked trees, query languages, tree automata, model theory
4	Celso C. Ribeiro, Rodrigo F. Toso	Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights.	WEA	2007	DBLP DOI BibTeX RDF	DRD-trees, algorithms, data structures, Minimum spanning trees, dynamic graph algorithms, experimental analysis
4	Hillol Kargupta, Byung-Hoon Park, Haimonti Dutta	Orthogonal Decision Trees.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	Orthogonal decision trees, redundancy free trees, Fourier transform, principle component analysis
4	A. Murua	The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series.	Foundations of Computational Mathematics	2006	DBLP DOI BibTeX RDF	Free Lie algebra, Continous BCH function, Hopf algbra of rooted trees, Hall rooted trees, Lie series, Dual PBW basis, Rewritting algorithm, Logarithm of Chenn-Fliess series, Series of vector fields, Rooted tree
4	Stavroula Siachalou, Leonidas Georgiadis	Algorithms for precomputing constrained widest paths and multicast trees.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	bottleneck paths, widest paths, widest trees, graph theory, QoS routing, multicast trees, precomputation
4	Stavros D. Nikolopoulos, Charis Papadopoulos	The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF	Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
4	Paolo Penna, Carmine Ventre	Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.	PE-WASUN	2004	DBLP DOI BibTeX RDF	light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees
4	Hanan Samet	Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing.	ACM Trans. Database Syst.	2004	DBLP DOI BibTeX RDF	BV-trees, PK-trees, space decomposition, R-trees, decoupling, Spatial indexing, object hierarchies
4	Kazuhiko Kato	Persistently Cached B-Trees.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	B^+-trees, secondary storage management, persistent caching, replication, database management system, B-trees, complex objects, indexing structure
4	Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung	Constructing Edge-Disjoint Spanning Trees in Product Networks.	IEEE Trans. Parallel Distrib. Syst.	2003	DBLP DOI BibTeX RDF	Cartesian product networks, edge-disjoint trees, fault-tolerance, interconnection networks, embedding, spanning trees
4	Manuel Gómez, Andrés Cano	Applying Numerical Trees to Evaluate Asymmetric Decision Problems.	ECSQARU	2003	DBLP DOI BibTeX RDF	asymmetric decision problems, numerical trees, probability trees, Influence diagrams
4	Bryant A. Julstrom, Günther R. Raidl	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.	SAC	2002	DBLP DOI BibTeX RDF	random spanning trees, sets of edges, spanning trees, initialization
4	Jennie C. Hansen, Eric Schmutz	Near-Optimal Bounded-Degree Spanning Trees.	Algorithmica	2001	DBLP DOI BibTeX RDF	Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis
4	Hussein A. Abbass, Michael Towsey, Gerard D. Finn	C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees.	Knowl. Inf. Syst.	2001	DBLP DOI BibTeX RDF	C5, Multivariate decision trees, Univariate decision trees, Neural networks
4	Gopal Racherla, Sridhar Radhakrishnan, B. John Oommen	A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees.	ICAPR	2001	DBLP DOI BibTeX RDF	pattern recognition of geometric objects, layered segment trees, segment trees
4	Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka	Parallel Construction of Multidimensional Binary Search Trees.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	multidimensional binary search trees, parallel algorithms, parallel computers, hypercubes, meshes, k-d trees
4	Yuan Gao, Ye Ge, Jennifer C. Hou	RMCM: Reliable Multicasts for Core-based Multicast Trees. (PDF / PS)	ICNP	2000	DBLP DOI BibTeX RDF	core-based multicast trees, RMCM, multicast applications, on-tree router, core-based tree, retransmission request, optimal recovery, turning point approach, IP options, group membership changes, repliers, delayed ACK approach, repair-based reliable multicast, NAK implosion control, recovery latency, recovery isolation, FreeBSD 2.2.8, Internet, Internet, transport protocols, packet switching, network topology, digital simulation, trees (mathematics), telecommunication network routing, multicast communication, reliable multicasts, event-driven simulation, topology changes, local recovery, data packets, hosts
4	Athanassios Papagelis, Dimitrios Kalles	GA Tree: genetically evolved decision trees.	ICTAI	2000	DBLP DOI BibTeX RDF	GA Tree, genetically evolved decision trees, classification decision tree evolution, standard discretized concept learning problems, C4 5, OneR, genetic algorithms, genetic algorithms, learning (artificial intelligence), decision trees, search problems, system performance
4	Isamu Shioya, Takao Miura	Knowledge pruning in decision trees.	ICTAI	2000	DBLP DOI BibTeX RDF	knowledge pruning, pruning method, semantic hierarchies, hierarchy levels, UCI Machine Learning Repository On Car Evaluation and Nursery, data mining, learning (artificial intelligence), decision trees, decision trees, domain knowledge
4	Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shimodaira	A visualization tool for interactive learning of large decision trees.	ICTAI	2000	DBLP DOI BibTeX RDF	large decision tree visualization, moderately sized datasets, decision tree induction programs, very large trees, T2 5D, data mining, data mining, decision trees, interactive systems, data visualisation, very large databases, learning process, visualization tool, interactive learning, large datasets, learning by example, visualization technique, decision tree induction, tree visualizers, learning techniques
4	Alexandros Kalousis, Melanie Hilario	Model selection via meta-learning: a comparative study.	ICTAI	2000	DBLP DOI BibTeX RDF	NOEMON, dataset characteristics, base-level inducers, instance based learners, boosted decision trees, learning (artificial intelligence), decision trees, decision trees, meta-models, model selection, meta-learning, instance based learning
4	Mario A. Nascimento, Margaret H. Dunham	Indexing Valid Time Databases via B+-Trees.	IEEE Trans. Knowl. Data Eng.	1999	DBLP DOI BibTeX RDF	$rm B^+$-trees, indexing, Temporal databases, R-trees, access structures
4	Vijay S. Iyengar	HOT: Heuristics for Oblique Trees. (PDF / PS)	ICTAI	1999	DBLP DOI BibTeX RDF	oblique trees, data mining, machine learning, classification, decision trees
4	Conrado Martínez, Salvador Roura	Randomized Binary Search Trees.	J. ACM	1998	DBLP DOI BibTeX RDF	probabilistic algebraic specification, randomized data structures, self-organizing data structures, search trees, balanced trees
4	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
4	Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel	Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).	Euro-Par	1997	DBLP DOI BibTeX RDF	Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms
4	T. Y. Chen, Y. Y. Cheung	Structural Properties of Post-Dominator Trees.	Australian Software Engineering Conference	1997	DBLP DOI BibTeX RDF	post dominator trees, program slicing, trees (mathematics), test suite reduction, structural properties, construction algorithm, code optimisation
4	Fabrizio Petrini, Marco Vanneschi	k -ary n -trees: High Performance Networks for Massively Parallel Architectures. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	k-ary n-trees, flowcontrol, congestion-free patterns, routing, Interconnection networks, virtual channels, fat-trees
4	Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen	An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	efficient parallel strategy, K-terminal reliability computation, most vital edge finding, 2-trees, partial 2-trees, connected graph components, logarithmic time, reliability, processors, edges, computation time, vertices, CRCW PRAM
4	Jie Wu, Eduardo B. Fernández, Yingquiu Luo	Embedding of binomial trees in hypercubes with link faults. (PDF / PS)	ICPP	1997	DBLP DOI BibTeX RDF	binomial trees embedding, variable roots, faulty links, n-level binomial tree, spanning binomial trees, fault tolerance property, reduction operations, binomial tree structure, performance, broadcasting, hypercubes, hypercube networks, n-cubes, link faults
4	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
4	Sabine R. Öhring, Maximilian Ibel, Sajal K. Das, Mohan Kumar	On generalized fat trees. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	generalized fat trees, multiprocesser interconnection networks, connection machine architecture, pruned butterflies, fat tree based architecture, inner nodes, leaf processors, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, fault tolerant self-routing, reliability, parallel architectures, fault tolerant computing, broadcasting, hypercubes, multiprocessor interconnection networks, trees, meshes, communication complexity, symmetry, routers, network routing, switches, rings, pyramids, tori, CM-5
4	Fengrong Ren, Hiroshi Tanaka, Noria Fukuda, Takashi Gojobori	Molecular evolutionary phylogenetic trees based on minimum description length principle.	HICSS	1995	DBLP DOI BibTeX RDF	molecular evolutionary phylogenetic trees, minimum complexity phylogenetic tree, branch lengths, logarithmic likelihood, mitochondrial DNA sequences, complexity, trees (mathematics), inference mechanisms, DNA, genetics, biology computing, inductive inference, minimum description length principle, tree topology
4	Milena Mihail, Christos Kaklamanis, Satish Rao	Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.	FOCS	1995	DBLP DOI BibTeX RDF	efficient access, optical bandwidth wavelength routing, directed fiber trees, directed graph models, trees of rings, fiber links, physical directedness, optical amplifiers, polynomial time routing algorithm, optical wavelengths, fixed W wavelength technology, optical routing requirements, coloring paradigms, multicolored alternating cycles, averaging analysis, directed graphs, trees (mathematics), wavelength division multiplexing, wavelength division multiplexing, graph colouring, optical communication, approximation factor, WDM optical networks, ring topologies, tree topologies
4	Atsuhiro Takasu, Shin'ichi Satoh, Eishi Katsura	A rule learning method for academic document image processing. (PDF / PS)	ICDAR	1995	DBLP DOI BibTeX RDF	educational administrative data processing, syntactic rule learning method, academic document image processing, CyberMagazine, database tuples, block segmentation, rough classification, two dimensional plane, ordinal context free grammar, symbol concatenation, non terminal symbols, decomposed trees, learning (artificial intelligence), image segmentation, image classification, trees (mathematics), document image processing, computational linguistics, visual databases, visual database, context-free grammars, syntactic analysis, parse trees, digital library system
4	Bruce A. Draper, Carla E. Brodley, Paul E. Utgoff	Goal-Directed Classification Using Linear Machine Decision Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	goal-directed classification, linear machine decision trees, feature-based classification, nonparametric classification, linear machine decision tree, multivariate decision tree induction, misclassification cost functions, image understanding systems, pattern recognition, computer vision, trees (mathematics), inference mechanisms, decision theory, learning systems, pixel classification, inference algorithms
4	Zicheng Guo, Rami G. Melhem	Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	binaryX-trees, spanning buses, 2-D arrayarchitectures, routing step, parallel architectures, multiprocessor interconnection networks, embedding, network routing, binary trees, processor arrays, pyramids, network embeddings
4	Tao Yang, Apostolos Gerasoulis	DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling
4	Mee Yee Chan, Shiang-Jen Lee	Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes.	IEEE Trans. Parallel Distrib. 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
4	Zhi-Jian (Alex) Mou, Francis Jutand	``Overturned-Stairs'' Adder Trees and Multiplier Design.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	VLSI circuit layout, multioperand adders, Overturned-Stairs trees, 2's complement parallel multiplier, VLSI, logic design, digital arithmetic, trees (mathematics), adders, multiplying circuits, Wallace trees
4	Renzo Sprugnoli	The Generation of Binary Trees as a Numerical Problem.	J. ACM	1992	DBLP DOI BibTeX RDF	generation of binary trees, binary trees
4	Sakti Pramanik, Myoung-Ho Kim	Parallel Processing of Large Node B-Trees.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	large node B-trees, tree height, parallel algorithms, parallel processing, parallel processing, concurrency, trees (mathematics), response time, B-trees
4	Jonathan Schaeffer	The History Heuristic and Alpha-Beta Search Enhancements in Practice.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	history heuristic, alpha-beta search enhancements, minimax trees, interior nodes, transposition tables, trees (mathematics), search problems, minimax techniques, game trees
4	Richard W. Selby, Adam A. Porter	Learning from Examples: Generation and Evaluation of Decision Trees for Software Resource Analysis.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	software resource analysis, production environment, machine learning, software engineering, software engineering, artificial intelligence, artificial intelligence, metrics, decision trees, trees (mathematics), decision theory, NASA, software modules
4	Rolf Klein, Derick Wood	On the Maximum Path Length of AVL Trees.	CAAP	1988	DBLP DOI BibTeX RDF	brother trees, comparison cost, node visit cost, AVL trees, path length
4	Vijay K. Vaishnavi	Computing Point Enclosures.	IEEE Trans. Computers	1982	DBLP DOI BibTeX RDF	VLSI artwork analysis, Augmented segment trees, dual range queries, inverse range queries, multilayered segment trees, point enclosure queries, S-trees, databases, segment trees
4	Rudolf Bayer, Karl Unterauer	Prefix B-Trees.	ACM Trans. Database Syst.	1977	DBLP DOI BibTeX RDF	multiway search trees, B-trees, key compression
4	Rudolf Bayer, J. K. Metzger	On the Encipherment of Search Trees and Random Access Files.	ACM Trans. Database Syst.	1976	DBLP DOI BibTeX RDF	encipherment, indexed sequential files, privacy transformation, random access files, security, privacy, cryptography, indexes, paging, protection, B-trees, search trees
3	Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz	Resource Allocation in Bounded Degree Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation
3	Giridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis	Maintaining colored trees for disjoint multipath routing under node failures.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	IP fast rerouting, colored trees, multipath routing
3	Jennifer A. Smith	RNA Search with Decision Trees and Partial Covariance Models.	IEEE/ACM Trans. Comput. Biology Bioinform.	2009	DBLP DOI BibTeX RDF	covariance models, RNA database search, decision trees, Bioinformatics, computational intelligence
3	Efi Papatheocharous, Andreas S. Andreou	Classification and Prediction of Software Cost through Fuzzy Decision Trees.	ICEIS	2009	DBLP DOI BibTeX RDF	CHAID, classification, Software cost estimation, CART, fuzzy decision trees
3	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
3	Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral	Binary Probability Trees for Bayesian Networks Inference.	ECSQARU	2009	DBLP DOI BibTeX RDF	Bayesian networks inference, variable elimination algorithm, probability trees, deterministic algorithms, approximate computation
3	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
3	Joaquim Marques de Sá, João Gama, 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
3	Hichem Boudali, A. P. Nijmeijer, Mariëlle Stoelinga	DFTSim: a simulation tool for extended dynamic fault trees.	SpringSim	2009	DBLP DOI BibTeX RDF	reliability benchmark, dependability analysis, simulation tool, dynamic fault trees
3	Johannes Köbler, Sebastian Kuhnert	The Isomorphism Problem for k-Trees Is Complete for Logspace.	MFCS	2009	DBLP DOI BibTeX RDF	graph canonization, logspace completeness, graph isomorphism, space complexity, k-trees
3	Khalil Djelloul	From exponential to almost linear decomposability of finite or infinite trees.	SAC	2009	DBLP DOI BibTeX RDF	solving first order constraints, theory of trees, first-order logic, rewriting rules
3	Zhipeng Xie	Improved AdaBoost.M1 of decision trees with confidence-rated predictions.	SAC	2009	DBLP DOI BibTeX RDF	confidence-rated predictions, decision trees, AdaBoost
3	Puntip Pattaraintakorn	Entropy Measures of Flow Graphs with Applications to Decision Trees.	RSKT	2009	DBLP DOI BibTeX RDF	Decision trees, Entropy, Flow graphs
3	Benoît Caldairou, Benoît Naegel, Nicolas Passat	Segmentation of Complex Images Based on Component-Trees: Methodological Tools.	ISMM	2009	DBLP DOI BibTeX RDF	Component-trees, attribute-filtering, segmentation, grey-level images
3	Benoît Naegel, Nicolas Passat	Component-Trees and Multi-value Images: A Comparative Study.	ISMM	2009	DBLP DOI BibTeX RDF	Component-trees, multi-value images, connected operators
3	Mori Kurokawa, Hiroyuki Yokoyama, Akito Sakurai	Averaged Naive Bayes Trees: A New Extension of AODE.	ACML	2009	DBLP DOI BibTeX RDF	augmented naive Bayes, averaged one-dependence estimators, naive Bayes trees, model averaging, naive Bayes
3	Jing Yongbin, Wang Liguan, Bi Lin, Chen Jianhong	Boolean Operations on Polygonal Meshes Using OBB Trees.	ESIAT	2009	DBLP DOI BibTeX RDF	intersection test, OBB trees, Boolean operations, polygonal meshes, BSP trees
3	Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky	A new perspective on implementation by voting trees.	ACM Conference on Electronic Commerce	2009	DBLP DOI BibTeX RDF	copeland rule, voting trees, approximation, computational social choice
3	Pei-Pei Li, Xuegang Hu, Qianhui Liang, Yunjun Gao	Concept Drifting Detection on Noisy Streaming Data in Random Ensemble Decision Trees.	MLDM	2009	DBLP DOI BibTeX RDF	Ensemble Decision Trees, Data Streams, Noise, Concept Drift
3	Elena Ikonomovska, João Gama, Raquel Sebastião, Dejan Gjorgjevik	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
3	Feng Pan, Tim Converse, David Ahn, Franco Salvetti, Gianluca Donato	Feature selection for ranking using boosted trees.	CIKM	2009	DBLP DOI BibTeX RDF	boosted trees, information retrieval, feature selection
3	Jerry Ye, Jyh-Herng Chow, Jiang Chen, Zhaohui Zheng	Stochastic gradient boosted distributed decision trees.	CIKM	2009	DBLP DOI BibTeX RDF	decision trees, learning to rank, hadoop, mpi, distributed learning, web search ranking, gradient boosting
3	Germán Rodríguez, Ramón Beivide, Cyriel Minkenberg, Jesús Labarta, Mateo Valero	Exploring pattern-aware routing in generalized fat tree networks.	ICS	2009	DBLP DOI BibTeX RDF	k-ary n-trees, communication/traffic patterns, extended generalized fat trees (xgft's), network topologies, routing algorithms, clos networks
3	Dong Kyue Kim, Minhwan Kim, Heejin Park	Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays.	Algorithmica	2008	DBLP DOI BibTeX RDF	Index data structures, Suffix trees, Suffix arrays, String algorithms
3	Celine Vens, Jan Struyf, Leander Schietgat, Saso Dzeroski, Hendrik Blockeel	Decision trees for hierarchical multi-label classification.	Machine Learning	2008	DBLP DOI BibTeX RDF	Precision-recall analysis, Decision trees, Hierarchical classification, Multi-label classification, Functional genomics
3	Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhisa Ueda, Minoru Kanehisa, Hiroshi Mamitsuka	A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology.	TKDD	2008	DBLP DOI BibTeX RDF	labeled ordered trees, probabilistic models, maximum likelihood, Expectation-maximization
3	Cun-Quan Zhang, Yongbin Ou	Clustering, community partition and disjoint spanning trees.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	dynamic density, clustering, community, hierarchical clustering, Spanning trees, polynomial algorithm, dense subgraph
3	Ohad Rodeh	B-trees, shadowing, and clones.	TOS	2008	DBLP DOI BibTeX RDF	concurrency, Shadowing, b-trees, snapshots, copy-on-write
3	Weiyi Zhang, Guoliang Xue, Jian Tang, 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
3	Mike Sablatash	Designs and architectures of filter bank trees for spectrally efficient multi-user communications: review, modifications and extensions of wavelet packet filter bank trees.	Signal, Image and Video Processing	2008	DBLP DOI BibTeX RDF	Filter bank trees, Multi-user OFDM-type communication systems
3	Michael Brydon, Andrew Gemino	Classification trees and decision-analytic feedforward control: a case study from the video game industry.	Data Min. Knowl. Discov.	2008	DBLP DOI BibTeX RDF	Probability estimation trees, Decision tree analysis, Video game development, Data mining, Real options
3	Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz	Improved Approximation Algorithm for Convex Recoloring of Trees.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Convex recoloring, Approximation algorithms, Phylogenetic trees, Local ratio
3	Gary R. Weckman, Andrew P. Snow, Preeti Rastogi, M. Rangwala	Assessing Wireless Network Dependability through Knowledge Extraction via Decision Trees.	ICONS	2008	DBLP DOI BibTeX RDF	Wireless Network, Artificial Neural Networks, Decision Trees, Dependability
3	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
3	Sébastien Destercke, Gert de Cooman	Relating Epistemic Irrelevance to Event Trees.	SMPS	2008	DBLP DOI BibTeX RDF	Forward irrelevance, Event trees, Stochastic process, Independence
3	Francisco J. Almeida-Martínez, Jaime Urquiza-Fuentes, J. Ángel Velázquez-Iturbide	VAST: visualization of abstract syntax trees within language processors courses.	SOFTVIS	2008	DBLP DOI BibTeX RDF	visualization, abstract syntax trees