Search results for "R-trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	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
21	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
21	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
21	Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman 0001	Upward Drawings of Trees on the Minimum Number of Layers.	WALCOM	2008	DBLP DOI BibTeX RDF	Planar Drawing, k-layer Planar Drawing, Upward Drawing, Minimum Layer Upward Drawing, Algorithm, Trees, Line-labeling, Straight-line Drawing
21	Tomasz Maszczyk, Wlodzislaw Duch	Comparison of Shannon, Renyi and Tsallis Entropy Used in Decision Trees.	ICAISC	2008	DBLP DOI BibTeX RDF	information selection, decision trees, entropy, information theory, Decision rules
21	Roman Filipovych, Eraldo Ribeiro	Discovering Constrained Substructures in Bayesian Trees Using the E.M. Algorithm.	ICIAR	2008	DBLP DOI BibTeX RDF	constrained Bayesian trees, substructure discovery, E.M. algorithm, learning, motion recognition
21	Joseph Cheriyan, Mohammad R. Salavatipour	Packing element-disjoint steiner trees.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	element-disjoint, approximation algorithms, Steiner trees, hardness of approximation, Packing
21	Robert A. Morris 0002, Jacob K. Asiedu, William A. Haber, Fred SaintOurs, Robert D. Stevenson, Hua Tang	Database-backed decision trees with application to biological informatics.	J. Intell. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Biological informatics, Database-backed decision trees, Taxonomic keys
21	David McSherry	Mixed-initiative problem solving with decision trees.	Artif. Intell. Rev.	2007	DBLP DOI BibTeX RDF	Meta-level reasoning, Decision trees, Coverage, Mixed-initiative interaction
21	Lars Grunske, Kirsten Winter, Robert Colvin	Timed Behavior Trees and Their Application to Verifying Real-Time Systems.	ASWEC	2007	DBLP DOI BibTeX RDF	real time systems, model checking, requirements engineering, timed automata, Behavior Trees
21	Jingli Li, Manli Chen, Yonghong Xiang, Shaowen Yao 0001	Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees.	NPC	2007	DBLP DOI BibTeX RDF	(n and k)-star graph, a spanning tree, multiple spanning trees, all-port model, one-port model, all-to-all broadcasting, one-to-all broadcasting
21	Thomas Colcombet	A Combinatorial Theorem for Trees.	ICALP	2007	DBLP DOI BibTeX RDF	Topics Semigroups, Ramseyan factorisation, Infinite structures, Trees, Monadic second-order logic
21	Christof Löding, Alex Spelten	Transition Graphs of Rewriting Systems over Unranked Trees.	MFCS	2007	DBLP DOI BibTeX RDF	Infinite graphs, unranked trees, rewriting, reachability
21	Robert Colvin, Lars Grunske, Kirsten Winter	Probabilistic Timed Behavior Trees.	IFM	2007	DBLP DOI BibTeX RDF	model checking, probabilities, timed automata, Behavior Trees
21	Cyril Gavoille, Arnaud Labourel	On local representation of distances in trees.	PODC	2007	DBLP DOI BibTeX RDF	trees, distance, distributed representation
21	Adam M. Smith 0002, Joshua Geiger, Gregory M. Kapfhammer, Mary Lou Soffa	Test suite reduction and prioritization with call trees.	ASE	2007	DBLP DOI BibTeX RDF	call trees, regression testing
21	James F. Korsh, Paul LaFollette	A loopless Gray code for rooted trees.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Loopless, Gray code, rooted trees
21	Refael Hassin, Danny Segev	Robust subgraphs for trees and paths.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Approximation algorithms, decomposition, spanning trees, robust optimization
21	Pierre Geurts, Damien Ernst, Louis Wehenkel	Extremely randomized trees.	Mach. Learn.	2006	DBLP DOI BibTeX RDF	Decision and regression trees, Cut-point randomization, Bias/variance tradeoff, Kernel-based models, Supervised learning, Ensemble methods
21	Dan Pelleg, Andrew W. Moore 0001	Dependency trees in sub-linear time and bounded memory.	VLDB J.	2006	DBLP DOI BibTeX RDF	Probably approximately correct learning, Dependency trees, Data mining, Fast algorithms
21	Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee	Online mining of frequent query trees over XML data streams.	WWW	2006	DBLP DOI BibTeX RDF	frequent query trees, online mining, XML, data streams, web mining
21	Robert Tairas, Jeff Gray 0001	Phoenix-based clone detection using suffix trees.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	suffix trees, clone detection, software analysis, code clones
21	John Goddard, René MacKinney-Romero	Finding Spanish Syllabification Rules with Decision Trees.	FinTAL	2006	DBLP DOI BibTeX RDF	Automatic syllabification, machine learning, decision trees
21	Quming Zhou, Kartik Mohanram	Elmore model for energy estimation in RC trees.	DAC	2006	DBLP DOI BibTeX RDF	RC trees, interconnect, Energy estimation
21	Niels Landwehr, Mark A. Hall, Eibe Frank	Logistic Model Trees.	Mach. Learn.	2005	DBLP DOI BibTeX RDF	classification, logistic regression, model trees
21	Igor Chikalov, Mikhail Ju. Moshkov, Maria S. Zelentsova	On Optimization of Decision Trees.	Trans. Rough Sets	2005	DBLP DOI BibTeX RDF	optimization, Decision trees, complexity measures
21	Cécile Favre, Fadila Bentayeb	Bitmap Index-Based Decision Trees.	ISMIS	2005	DBLP DOI BibTeX RDF	Bitmap indices, data mining, performance, databases, decision trees
21	Ana Carolina Lorena, André Carlos Ponce de Leon Ferreira de Carvalho	Protein Cellular Localization with Multiclass Support Vector Machines and Decision Trees.	BSB	2005	DBLP DOI BibTeX RDF	protein cellular localization, Machine Learning, Decision Trees, multiclass Support Vector Machines
21	Hillol Kargupta, Byung-Hoon Park	A Fourier Spectrum-Based Approach to Represent Decision Trees for Mining Data Streams in Mobile Environments.	IEEE Trans. Knowl. Data Eng.	2004	DBLP DOI BibTeX RDF	Mobile data mining, decision trees, Fourier spectrum
21	Josep Domingo-Ferrer	On the Synergy Between Certificate Verification Trees and PayTree-like Micropayments.	EuroPKI	2004	DBLP DOI BibTeX RDF	PKI and eCommerce, Certificate Directories, Coin-Based Payments, PayTree, Certificate Verification Trees, Protocols, Micropayments
21	Chris Giannella, Kun Liu 0001, Todd Olsen, Hillol Kargupta	Communication Efficient Construction of Decision Trees Over Heterogeneously Distributed Data.	ICDM	2004	DBLP DOI BibTeX RDF	Decision Trees, Distributed Data Mining, Random Projection
21	João Gama 0001, Pedro Medas, Ricardo Rocha 0003	Forest trees for on-line data.	SAC	2004	DBLP DOI BibTeX RDF	Hybrid Forest of Trees, data streams
21	Umar Syed, Golan Yona	Using a mixture of probabilistic decision trees for direct prediction of protein function.	RECOMB	2003	DBLP DOI BibTeX RDF	functional prediction, sequence-function relationships, decision trees
21	Baoying Wang, Fei Pan, Dongmei Ren, Yue Cui, Qiang Ding, William Perrizo	Efficient OLAP operations for spatial data using peano trees.	DMKD	2003	DBLP DOI BibTeX RDF	PD-cube, Online Analytical Processing (OLAP), spatial data, P-Trees
21	Gianluigi Folino, Clara Pizzuti, Giandomenico Spezzano	Improving Induction Decision Trees with Parallel Genetic Programming.	PDP	2002	DBLP DOI BibTeX RDF	classification, parallel processing, Genetic programming, Decision Trees
21	Ganesh J. Pai, Joanne Bechta Dugan	Automatic Synthesis of Dynamic Fault Trees from UML System Models.	ISSRE	2002	DBLP DOI BibTeX RDF	Fault tree synthesis, UML, Reliability analysis, Dynamic fault trees
21	Limin Xiang, Kazuo Ushijima, Yuichi Asahiro	Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order.	ITCC	2002	DBLP DOI BibTeX RDF	coding $k$-ary trees, loopless generation, lexicographic order
21	Pierre Fraigniaud, Cyril Gavoille	Routing in Trees.	ICALP	2001	DBLP DOI BibTeX RDF	trees, routing algorithms, compact routing
21	Petr Salinger, Pavel Tvrdík	Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing.	IPDPS	2000	DBLP DOI BibTeX RDF	distance-insensitive switching, all-port capability, broadcast, mesh of trees
21	Dima Grigoriev	Complexity lower bounds for randomized computation trees over zero characteristic fields.	Comput. Complex.	1999	DBLP DOI BibTeX RDF	Randomized computation trees, multiplicative complexity, distinctness problem, knapsack problem
21	Nils Klarlund, Michael I. Schwartzbach	A Domain-Specific Language for Regular Sets of Strings and Trees.	IEEE Trans. Software Eng.	1999	DBLP DOI BibTeX RDF	regular sets, trees, Domain-specific languages, logic, strings
21	Alberto Suárez 0001, James F. Lutsko	Globally Optimal Fuzzy Decision Trees for Classification and Regression.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	classification, decision trees, global optimization, fuzzy set theory, backpropagation, nonparametric regression, Automatic learning
21	Antonio Corral, Michael Vassilakopoulos, Yannis Manolopoulos	Algorithms for Joining R-Trees and Linear Region Quadtrees.	SSD	1999	DBLP DOI BibTeX RDF	query processing, Spatial databases, access methods, R-trees, joins, linear quadtrees
21	Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg	Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model.	FOCS	1998	DBLP DOI BibTeX RDF	PAC Learnability, Algorithms, evolutionary trees, discrete distributions
21	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.	COCOON	1998	DBLP DOI BibTeX RDF	ultrametric trees, approximation algorithms, branch and bound, computational biology
21	Sung Kwon Kim	An efficient parallel algorithm for the planar mincut linear arrangement problem for trees.	ISPAN	1997	DBLP DOI BibTeX RDF	planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable
21	Ion Muslea	The Very Offline k-Vehicle Routing Problem in Trees.	SCCC	1997	DBLP DOI BibTeX RDF	very offline k-vehicle routing problem, general vehicle routing problem, NP-complete variants, fast approximation algorithms, 2-vehicle routing problems, computational complexity, trees
21	Arend Rensink	Denotational, Causal, and Operational Determinism in Event Structures.	CAAP	1996	DBLP DOI BibTeX RDF	partial order models, trees, determinism, event structures, concurrent languages, behavioural models
21	S. Jeromy Carrière, Rick Kazman	Research report: Interacting with huge hierarchies: beyond cone trees.	INFOVIS	1995	DBLP DOI BibTeX RDF	huge information hierarchy visualisation, huge information hierarchy interaction, huge hierarchies, tool efficacy, fsviz, graphical techniques, usage-based filtering, animated zooming, hand-coupled rotation, fish-eye zooming, distant node coalescence, cone tree visualization systems, node layout algorithm, interaction techniques, texturing, computer animation, data visualisation, empirical evaluation, dynamic queries, tree data structures, colour, depth cueing, user control, visual clutter, cone trees
21	Joseph L. Ganley, James P. Cohoon	Thumbnail rectilinear Steiner trees.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	full-set decomposition algorithm, minimum-length set, thumbnail rectilinear Steiner tree problem, VLSI placement algorithms, geometric partitioning, field programmable gate arrays, field-programmable gate arrays, VLSI, dynamic programming, network topology, logic CAD, trees (mathematics), network routing, circuit layout CAD, global routing, line segments
20	Seung-Jin Sul, Tiffani L. Williams	An Experimental Analysis of Consensus Tree Algorithms for Large-Scale Tree Collections.	ISBRA	2009	DBLP DOI BibTeX RDF
20	Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eulenstein, David Fernández-Baca	Generalized Binary Tanglegrams: Algorithms and Applications.	BICoB	2009	DBLP DOI BibTeX RDF
20	Sen Zhang, Jason Tsong-Li Wang	Discovering Frequent Agreement Subtrees from Phylogenetic Data.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF	Data mining, Bioinformatics (genome or protein) databases
20	Jeffrey Xu Yu, Zhiheng Li, Guimei Liu	A data mining proxy approach for efficient frequent itemset mining.	VLDB J.	2008	DBLP DOI BibTeX RDF
20	Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff 0001	Drawing (Complete) Binary Tanglegrams.	GD	2008	DBLP DOI BibTeX RDF
20	Wenxing Peng, Taro Terao, Yoshihiro Masuda, Naofumi Yoshida, Jun Miyazaki	Document History System and its Application to Abnormal Document Access Pattern Detection with a Probabilistic Model.	AINA	2008	DBLP DOI BibTeX RDF	Document History, MTMM, Probabilistic Model, Abnormal Detection
20	Guoliang Li 0001, Xuhui Liu, Jianhua Feng, Lizhu Zhou	Efficient Similarity Search for Tree-Structured Data.	SSDBM	2008	DBLP DOI BibTeX RDF
20	Ashraf M. Kibriya, Eibe Frank	An Empirical Comparison of Exact Nearest Neighbour Algorithms.	PKDD	2007	DBLP DOI BibTeX RDF
20	Ken-ichi Kawarabayashi	Half integral packing, Erdős-Posá-property and graph minors.	SODA	2007	DBLP BibTeX RDF
20	Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris	Entropy-driven parity-tree selection for low-overhead concurrent error detection in finite state machines.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
20	Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nakhleh	Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer.	Comparative Genomics	2006	DBLP DOI BibTeX RDF
20	Paula Severi, Fer-Jan de Vries	Continuity and Discontinuity in Lambda Calculus.	TLCA	2005	DBLP DOI BibTeX RDF
20	Cheng Peng, Qionghai Dai, Qiufeng Wu	An Adaptive Hierarchical Clustering Protocol for Multimedia Overlay Multicast Applications.	ICME	2005	DBLP DOI BibTeX RDF
20	Kohei Miyase, Seiji Kajihara, Sudhakar M. Reddy	Multiple Scan Tree Design with Test Vector Modification.	Asian Test Symposium	2004	DBLP DOI BibTeX RDF
20	Abhishek P. Patil, Yunhao Liu 0001, Lionel M. Ni, Li Xiao 0001, Abdol-Hossein Esfahanian	POMA: Prioritized Overlay Multicast in Ad Hoc Environments.	HiPC	2003	DBLP DOI BibTeX RDF
20	Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara	Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data.	ALT	2002	DBLP DOI BibTeX RDF
20	Shimin Chen, Phillip B. Gibbons, Todd C. Mowry	Improving Index Performance through Prefetching.	SIGMOD Conference	2001	DBLP DOI BibTeX RDF
20	Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha	Biased dictionaries with fast insert/deletes.	STOC	2001	DBLP DOI BibTeX RDF
20	David J. McClurkin, George F. Georgakopoulos	Sphendamnoe: A Proof that k-Splay Fails to Achieve logkN Behaviour.	Panhellenic Conference on Informatics	2001	DBLP DOI BibTeX RDF
20	Michael T. Hallett, Jens Lagergren	New algorithms for the duplication-loss model.	RECOMB	2000	DBLP DOI BibTeX RDF
20	Jeffrey Scott Vitter	Online Data Structures in External Memory.	ICALP	1999	DBLP DOI BibTeX RDF
20	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Finding Smallest Supertrees Under Minor Containment.	WG	1999	DBLP DOI BibTeX RDF
20	Klaus Jansen, Petra Scheffler	Generalized Coloring for Tree-like Graphs.	WG	1992	DBLP DOI BibTeX RDF
20	Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang	Broadcasting on incomplete hypercubes.	SPDP	1991	DBLP DOI BibTeX RDF
20	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
20	Reiner Heilmann, Stefan Rothbauer, Ariane Sutor	Component Fault Tree Analysis Resolves Complexity: Dependability Confirmation for a Railway Brake System.	SAFECOMP	2007	DBLP DOI BibTeX RDF	Hierarchical Fault Trees, Combinatorial Fault Trees, Railway Brake System, Practical Example
20	Lizhen Wang, Junli Lu, Joan Lu, Jim Yip	AOG-ags Algorithms and Applications.	ADMA	2007	DBLP DOI BibTeX RDF	Attribute-oriented generalization (AOG), Concept hierarchy trees, Attributes’ generalization sequences (AGS), Equivalence partition trees, Interestingness of AGS
20	Yangjun Chen, Yibin Chen	On the Signature Tree Construction and Analysis.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	bit-slice files, S-trees, signature trees, information retrieval, Signature files
20	Houari A. Sahraoui, Mounir Boukadoum, Hakim Lounis, Frédéric Ethève	Predicting class libraries interface evolution: an investigation into machine learning approaches.	APSEC	2000	DBLP DOI BibTeX RDF	class library interface evolution prediction, object-oriented system evolution management, reusable class libraries, version compatibility, symptomatic instability detection, fuzzy logic-based approach, structural metrics, stability indicators, commercial C++ class libraries, top down induction of decision trees, machine learning, user interfaces, user interface, learning (artificial intelligence), fuzzy logic, object-oriented programming, decision trees, software quality, software metrics, software reusability, pattern classification, Bayes methods, software libraries, software development management, Bayesian classifiers, management of change
20	Borisas Bursteinas, James Allen Long	Transforming supervised classifiers for feature extraction.	ICTAI	2000	DBLP DOI BibTeX RDF	supervised classifiers, supervised linear feature extraction algorithm, class labels, extracted feature quality evaluation, multivariate decision trees, classifier induction, feature subset evaluation, wrapper model method, algorithm performance evaluation, data mining, learning (artificial intelligence), feature extraction, feature selection, decision trees, pattern classification, software performance evaluation, computation time, very large databases, computational efficiency, data classification, large databases
20	Ron Shamir, Dekel Tsur	Faster subtree isomorphism.	ISTCS	1997	DBLP DOI BibTeX RDF	subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem
20	Joydeep Ghosh, Sajal K. Das 0001, Ajita John	Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	concurrentprocessing, linearly ordered data structures, concurrentmanipulation, augmented binomial search tree, pruned binomial tree, arbitrary processor node, consecutive nodes, nonoverlappingprocessor lists, intermediate-levelimage processing algorithms, dictionary operations, low-level image processingalgorithms, Gray code embedding, distributed memorymulticomputers, parallel algorithms, parallel programming, broadcast, hypercube networks, trees (mathematics), distributed memory systems, search problems, merge, tree data structures, search trees, k-ary n-cubes, concurrent data structure, hypercube multicomputers, local information, fanout, hypercube systems
20	Khaled Day, Anand R. Tripathi	A Comparative Study of Topological Properties of Hypercubes and Star Graphs.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	networktopology, interconnection network topologies, comparativestudy, parallel paths, asymptotically balanced, balanced spanning trees, graph theory, graph theory, hypercubes, multiprocessor interconnection networks, hypercube networks, spanning trees, star graphs, greedy
20	Laurie J. Hendren, Alexandru Nicolau	Parallelizing Programs with Recursive Data Structures.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	disambiguation techniques, interference analysis tools, parallelization techniques, dynamically updatable trees, regular-expression-like representation, accessible nodes, parallel programming, data structures, directed graphs, interference, program compilers, trees (mathematics), directed acyclic graphs, parallelizing compilers, automatic parallelization, dynamic data structures, parallel programming languages, recursive data structures, imperative programs, imperative language
20	Timothy M. Chan	Optimal partition trees.	SCG	2010	DBLP DOI BibTeX RDF	halfspace range searching, simplex range searching, geometric data structures
20	Frank Reichartz, Hannes Korte, Gerhard Paass	Semantic relation extraction with kernels over typed dependency trees.	KDD	2010	DBLP DOI BibTeX RDF	information extraction, text mining, relation extraction
20	Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton	Suffix trees for very large genomic sequences.	CIKM	2009	DBLP DOI BibTeX RDF	suffix tree, external memory algorithms
20	Navin Goyal, Luis Rademacher, Santosh S. Vempala	Expanders via random spanning trees.	SODA	2009	DBLP DOI BibTeX RDF
20	Ulf Johansson, Lars Niklasson	Evolving decision trees using oracle guides.	CIDM	2009	DBLP DOI BibTeX RDF
20	Özlem Aslan, Olcay Taner Yildiz, Ethem Alpaydin	Calculating the VC-dimension of decision trees.	ISCIS	2009	DBLP DOI BibTeX RDF
20	Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon	Minimal Locked Trees.	WADS	2009	DBLP DOI BibTeX RDF
20	Yo-Ping Huang, Vu Thi Thanh Hoa	General criteria on building decision trees for data classification.	ICIS	2009	DBLP DOI BibTeX RDF	ID3 algorithm, classification, decision tree, information gain
20	Amos Korman, David Peleg	Compact separator decompositions in dynamic trees and applications to labeling schemes.	Distributed Comput.	2008	DBLP DOI BibTeX RDF	Informative labeling schemes, Distributed algorithms, Dynamic networks, Graph decompositions, Routing schemes
20	Noa Agmon, Noam Hazon, Gal A. Kaminka	The giving tree: constructing trees for efficient offline and online multi-robot coverage.	Ann. Math. Artif. Intell.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68T40 Robotics
20	Godwin Shen, Antonio Ortega	Comopact image representation using wavelet lifting along arbitrary trees.	ICIP	2008	DBLP DOI BibTeX RDF
20	Simon Marcellin, Djamel A. Zighed, Gilbert Ritschard	Evaluating Decision Trees Grown with Asymmetric Entropies.	ISMIS	2008	DBLP DOI BibTeX RDF
20	Beau Piccart, Jan Struyf, Hendrik Blockeel	Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees.	Discovery Science	2008	DBLP DOI BibTeX RDF
20	Diego Arroyuelo	An Improved Succinct Representation for Dynamic k-ary Trees.	CPM	2008	DBLP DOI BibTeX RDF
20	Jirí Fiala 0001, Petr A. Golovach, Jan Kratochvíl	Distance Constrained Labelings of Trees.	TAMC	2008	DBLP DOI BibTeX RDF
20	Yuzhen Liu, Weifa Liang	Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks.	WWIC	2008	DBLP DOI BibTeX RDF