Search results for "R-trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Ka Wong Chong, Yijie Han, Tak Wah Lam	Concurrent threads and optimal parallel minimum spanning trees algorithm.	J. ACM	2001	DBLP DOI BibTeX RDF	parallel algorithms, minimum spanning trees, connected components, EREW PRAM
18	Alexander O. Skomorokhov, Vladimir Kutinsky	Classification trees in APL: implementation and application.	APL	2001	DBLP DOI BibTeX RDF	vibration monitoring, data mining, APL, pruning, cross-validation, classification trees
18	Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen	Concurrency Control for B-Trees with Differential Indices.	IDEAS	2000	DBLP DOI BibTeX RDF	differential indices, indexing system, main index, differential index, active transactions, committed transactions, batch-update operation, simple recovery scheme, system crash, redo operations, undo operations, concurrency control, concurrency control, updates, B-trees, main memory, database index
18	Andrzej S. Murawski, C.-H. Luke Ong	Dominator Trees and Fast Verification of Proof Nets.	LICS	2000	DBLP DOI BibTeX RDF	verification of proof nets, Linear Logic, dominator trees
18	Taghi M. Khoshgoftaar, Edward B. Allen	Predicting Fault-Prone Software Modules in Embedded Systems with Classification Trees.	HASE	1999	DBLP DOI BibTeX RDF	embedded systems, software metrics, software reliability, classification trees, CART, fault-prone modules, high assurance
18	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Constructing Light Spanning Trees with Small Routing Cost.	STACS	1999	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
18	J. Ian Munro, Venkatesh Raman 0001	Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs.	FOCS	1997	DBLP DOI BibTeX RDF	balanced parentheses, static trees, rooted ordered tree, planar graphs, abstract data types, abstract data types, binary tree, adjacency, succinct representation
18	Imrich Vrto	Cutwidth of the Mesh of dary Trees.	Euro-Par	1997	DBLP DOI BibTeX RDF	cutwidth, embedding, congestion, mesh of trees, bisection
18	Mariana Kant	Are 2*-trees interesting topologies for the interconnection of a network?	ICPADS	1997	DBLP DOI BibTeX RDF	2*-trees, time complexity, routing algorithms, communication complexity, communication complexity, gossiping, unicasting, connected graph
18	Elena Dubrova, Jon C. Muzio, Bernhard von Stengel	Finding Composition Trees for Multiple-Valued Functions.	ISMVL	1997	DBLP DOI BibTeX RDF	composition trees, disjunctive decompositions, m-valued n-variable functions, test generation, multivalued logic, computation time, multiple-valued functions, recursive algorithm
18	Christopher A. Welty	Augmenting Abstract Syntax Trees for Program Understanding.	ASE	1997	DBLP DOI BibTeX RDF	low-level searches, information delocalization, code-level knowledge representation, software information systems, reverse engineering, software maintenance, documentation, program understanding, source code, automated reasoning, discovery, abstract syntax trees
18	Jeffrey Huang, Srinivas Gutta, Harry Wechsler	Detection of human faces using decision trees.	FG	1996	DBLP DOI BibTeX RDF	human face detection, FERET database, semi-uniform background, face box, face image normalization, visual observation, nose, mouth, image rejection, algorithm, face recognition, decision trees, location, post-processing, eyes, face images, cropping
18	Fenglien Lee, Richard Jou	Efficient parallel geometric algorithms on a mesh of trees.	ACM Southeast Regional Conference	1995	DBLP DOI BibTeX RDF	parallel algorithm, computational geometry, Voronoi diagram, Delaunay triangulation, convex hull, mesh of trees, all nearest neighbors
18	Hans L. Bodlaender	Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees.	SWAT	1988	DBLP DOI BibTeX RDF	Chromatic Index, graphs with small treewidth, polynomial time algorithms, NP-complete problems, Graph Isomorphism, tree-decompositions, partial k-trees
17	Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno	A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation
17	Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas	Linear time 3-approximation for the MAST problem.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree
17	Cédric Chauve, Nadia El-Mabrouk	New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees.	RECOMB	2009	DBLP DOI BibTeX RDF
17	Christian Bessiere, Emmanuel Hebrard, Barry O'Sullivan	Minimising Decision Tree Size as Combinatorial Optimisation.	CP	2009	DBLP DOI BibTeX RDF
17	Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001	Online Tree Node Assignment with Resource Augmentation.	COCOON	2009	DBLP DOI BibTeX RDF
17	Yanghua Xiao, Wentao Wu 0001, Jian Pei, Wei Wang 0009, Zhenying He	Efficiently indexing shortest paths by exploiting symmetry in graphs.	EDBT	2009	DBLP DOI BibTeX RDF
17	Maria João Nicolau, António Costa 0001, Joaquim Macedo 0001, Alexandre J. T. Santos	Class-based multicast routing in interdomain scenarios.	Ann. des Télécommunications	2008	DBLP DOI BibTeX RDF	Interdomain, Multicast, QoS routing
17	Naoyuki Kamiyama, Naoki Katoh	The Minimum Weight In-Tree Cover Problem.	MCO	2008	DBLP DOI BibTeX RDF
17	Micah Adler, Brent Heeringa	Search Space Reductions for Nearest-Neighbor Queries.	TAMC	2008	DBLP DOI BibTeX RDF
17	Lei Zhang 0024, Tae Hyun Kim 0004, Chunlei Liu 0010, Min-Te Sun, Alvin S. Lim	TART: Traffic-Aware Routing Tree for Geographic Routing.	WCNC	2008	DBLP DOI BibTeX RDF
17	Partha Biswas, Girish Venkataramani	Comprehensive isomorphic subtree enumeration.	CASES	2008	DBLP DOI BibTeX RDF	subtree isomorphism, subtree matching algorithm, embedded systems
17	Andreas Brandstädt, Van Bang Le	Simplicial Powers of Graphs.	COCOA	2008	DBLP DOI BibTeX RDF	simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers
17	Hiroki Matsutani, Michihiro Koibuchi, D. Frank Hsu, Hideharu Amano	Three-Dimensional Layout of On-Chip Tree-Based Networks.	ISPAN	2008	DBLP DOI BibTeX RDF	Fat H-Tree, Network-on-Chip, Fat Tree, 3-D IC
17	Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu	Statistical Learning Algorithm for Tree Similarity.	ICDM	2007	DBLP DOI BibTeX RDF
17	José L. Balcázar, Albert Bifet, Antoni Lozano	Subtree Testing and Closed Tree Mining Through Natural Representations.	DEXA Workshops	2007	DBLP DOI BibTeX RDF
17	Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati	How to Draw a Clustered Tree.	WADS	2007	DBLP DOI BibTeX RDF
17	Chi-Shong Wang, Chingwei Yeh	Performance-driven technology mapping with MSG partition and selective gate duplication.	ACM Trans. Design Autom. Electr. Syst.	2006	DBLP DOI BibTeX RDF	gate duplication, maximal super-gate, super-gate, dynamic programming, partition, matching, logic synthesis, directed acyclic graph, Technology mapping, covering
17	Horst Reichel	An Algebraic Approach to Regular Sets.	Essays Dedicated to Joseph A. Goguen	2006	DBLP DOI BibTeX RDF
17	Bijan Raahemi, Bashar Bou-Diab	A Minimum-Cost Resilient Tree-Based VPLS for Digital TV Broadcast Services.	CCECE	2006	DBLP DOI BibTeX RDF
17	Daniel H. Huson, Mike A. Steel, Jim Whitfield	Reducing Distortion in Phylogenetic Networks.	WABI	2006	DBLP DOI BibTeX RDF
17	Theodore Dalamagas 0001, Dimitri Theodoratos, Antonis Koufopoulos, Vincent Oria	Evaluation of Queries on Tree-Structured Data Using Dimension Graphs.	IDEAS	2005	DBLP DOI BibTeX RDF
17	Paula Severi, Fer-Jan de Vries	Order Structures on Böhm-Like Models.	CSL	2005	DBLP DOI BibTeX RDF
17	Liang Huai Yang, Mong-Li Lee, Wynne Hsu	Finding hot query patterns over an XQuery stream.	VLDB J.	2004	DBLP DOI BibTeX RDF	Pattern tree, Frequent pattern mining, Tree mining, Stream mining, XML query pattern
17	Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang	An Improved Algorithm for the Maximum Agreement Subtree Problem.	BIBE	2004	DBLP DOI BibTeX RDF	maximum agreement sub-tree, leaf-labelled tree, k-dimensional range search tree, k-dimensional binary search tree, Evolutionary tree
17	Stefan Birrer, Dong Lu, Fabián E. Bustamante, Yi Qiao, Peter A. Dinda	FatNemo: Building a Resilient Multi-source Multicast Fat-Tree.	WCW	2004	DBLP DOI BibTeX RDF
17	Flaminia L. Luccio, Jop F. Sibeyn	Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
17	Zhiheng Li, Jeffrey Xu Yu, Hongjun Lu, Yabo Xu, Guimei Liu	Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining.	PAKDD	2004	DBLP DOI BibTeX RDF
17	Nicholas Eriksson	Toric ideals of homogeneous phylogenetic models.	ISSAC	2004	DBLP DOI BibTeX RDF	Gröbner bases, parametric inference, phylogenetic invariants, toric ideals
17	Gabriel Valiente	Constrained Tree Inclusion.	CPM	2003	DBLP DOI BibTeX RDF	Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching
17	Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara	Ternary Directed Acyclic Word Graphs.	CIAA	2003	DBLP DOI BibTeX RDF
17	Dan Gusfield, Satish Eddhu, Charles H. Langley	Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination.	CSB	2003	DBLP DOI BibTeX RDF
17	Haiyuan Xu, Quanyuan Wu, Huaimin Wang, Guogui Yang, Yan Jia 0001	KF-Diff+: Highly Efficient Change Detection Algorithm for XML Documents.	OTM	2002	DBLP DOI BibTeX RDF
17	Richard Desper, Olivier Gascuel	Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle.	WABI	2002	DBLP DOI BibTeX RDF
17	Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida	Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF
17	Andreas Buja, Yung-Seop Lee	Data mining criteria for tree-based regression and classification.	KDD	2001	DBLP DOI BibTeX RDF	Boston Housing data, Pima Indians Diabetes data, splitting criteria, CART
17	Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella	Finite-Tree Analysis for Constraint Logic-Based Languages.	SAS	2001	DBLP DOI BibTeX RDF
17	Hon Nin Cheung, Li-Minn Ang, Kamran Eshraghian	Parallel Architecture for the Implementation of the Embedded Zerotree Wavelet Algorithm.	ACAC	2000	DBLP DOI BibTeX RDF	EZW, Parallel processing, image coding
17	Mely Chen Chi, Shih-Hsu Huang	A Reliable Clock Tree Design Methodology for ASIC Designs.	ISQED	2000	DBLP DOI BibTeX RDF	Clock tree design, Clock tree synthesis
17	Bart Jacobs 0001	Exercises in Coalgebraic Specification.	Algebraic and Coalgebraic Methods in the Mathematics of Program Construction	2000	DBLP DOI BibTeX RDF
17	Peter Aczel	Algebras and Coalgebras.	Algebraic and Coalgebraic Methods in the Mathematics of Program Construction	2000	DBLP DOI BibTeX RDF
17	Tolga Bozkaya, Z. Meral Özsoyoglu	Indexing Valid Time Intervals.	DEXA	1998	DBLP DOI BibTeX RDF
17	Magnús M. Halldórsson, Keisuke Tanaka	Approximation and Special Cases of Common Subtrees and Editing Distance.	ISAAC	1996	DBLP DOI BibTeX RDF
17	Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins	Near-optimal critical sink routing tree constructions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
17	Ren-Song Tsay	An exact zero-skew clock routing algorithm.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1993	DBLP DOI BibTeX RDF
17	Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann	Average Case Analysis of Unification Algorithms.	STACS	1991	DBLP DOI BibTeX RDF	generating functions, average case complexity, unification algorithms
17	A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack	A Computational geometry Workbench.	SCG	1990	DBLP DOI BibTeX RDF
17	John T. Robinson	The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes.	SIGMOD Conference	1981	DBLP DOI BibTeX RDF
17	Omar el Ariss, Dianxiang Xu, Santosh Dandey, Bradley Vender, Philip E. McClean, Brian M. Slator	A Systematic Capture and Replay Strategy for Testing Complex GUI Based Java Applications.	ITNG	2010	DBLP DOI BibTeX RDF	GUI-based testing, capture and replay, function trees, decision trees, model based testing
17	J. Donald Monk	On the Existence of Towers in Pseudo-Tree Algebras.	Order	2009	DBLP DOI BibTeX RDF	Towers, Pseudo-trees, Linearly ordered sets, Trees
17	Svante Janson, Wojciech Szpankowski	Partial fillup and search time in LC tries.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization
17	T. M. H. Chan, Robert P. K. Chan	A Simplified Approach to the Order Conditions of Integration Methods.	Computing	2006	DBLP DOI BibTeX RDF	real-valued functions on trees, the elementary weight function, series, two-step Runge-Kutta methods, two-derivative Runge-Kutta methods, linear multi-step methods, Rooted trees
17	Pallavi Tadepalli	Grid-based distributed search structure.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	B and B+ trees, distributed search trees, Service Oriented Architecture (SOA), grid computing
17	Adam Berry, Peter Vamplew 0001	An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm.	GECCO	2006	DBLP DOI BibTeX RDF	bi-objective, dual-objective, data structures, archives, multiobjective, red-black trees, multi-criteria, balanced trees
17	Raja Jothi, Balaji Raghavachari	Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, network design, Spanning trees, minimum spanning trees
17	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation
17	Gérard Assayag, Shlomo Dubnov	Using Factor Oracles for Machine Improvisation.	Soft Comput.	2004	DBLP DOI BibTeX RDF	Variable markov models, Prediction suffix trees, Factor oracle, Machine learning, Suffix trees, Computer music, Improvisation, Incremental parsing
17	Frantisek Brabec, Hanan Samet, Cemal Yilmaz	VASCO: visualizing and animating spatial constructs and operations.	SCG	2003	DBLP DOI BibTeX RDF	visualization, quadtrees, R-trees, k-d trees, nearest neighbor algorithms
17	Lélia Blin, Franck Butelle	The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs.	IPDPS	2003	DBLP DOI BibTeX RDF	Minimum degree spanning trees, Distributed algorithms, Spanning trees, Asynchronous algorithms, general graphs
17	Jochen Könemann, R. Ravi 0001	Primal-dual meets local search: approximating MST's with nonuniform degree bounds.	STOC	2003	DBLP DOI BibTeX RDF	degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation
17	Steffen Heinz, Justin Zobel, Hugh E. Williams	Burst tries: a fast, efficient data structure for string keys.	ACM Trans. Inf. Syst.	2002	DBLP DOI BibTeX RDF	string data structures, vocabulary accumulation, Binary trees, text databases, tries, splay trees
17	Amit Chowdhary, John P. Hayes	General technology mapping for field-programmable gate arrays based on lookup tables.	ACM Trans. Design Autom. Electr. Syst.	2002	DBLP DOI BibTeX RDF	lookup tables (LUTs), multiple-LUT blocks, nonrooted trees, field-programmable gate arrays, mapping, synthesis, circuit partitioning, rooted trees, Basis
17	Luis Eduardo Neves Gouveia, João Telhada	An Augmented Arborescence Formulation for the Two-Level Network Design Problem.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	spanning trees and steiner trees, multicommodity flow models, network design, linear programming relaxations
17	Jean-Charles Pomerol, Patrick Brézillon, Laurent Pasquier	Operational Knowledge Representation for Practical Decision Making.	HICSS	2001	DBLP DOI BibTeX RDF	Contextual trees, Operational decision making, Knowledge Representation, Decision trees, Context Representation
17	Bernhard Balkenhol, Stefan Kurtz	Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	context trees, suffix trees, Burrows-Wheeler Transformation, Lossless data compression
17	Ahto Buldas, Peeter Laud, Helger Lipmaa	Accountable certificate management using undeniable attestations.	CCS	2000	DBLP DOI BibTeX RDF	accountable certificate management, authenticated search trees, long-term authenticity, public-key infrastructure, non-repudiation, search trees, time-stamping, attesters
17	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	FOCS	2000	DBLP DOI BibTeX RDF	cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis
17	Torben Hagerup	Sorting and Searching on the Word RAM.	STACS	1998	DBLP DOI BibTeX RDF	word-level parallelism, exponential range reduction, fusion trees, exponential search trees, AC', searching, Sorting, network flow, multiplication, dictionaries, tries, word RAM, conservative algorithms
17	Krishnamoorthy Srinivasan, Douglas Fisher	Machine Learning Approaches to Estimating Software Development Effort.	IEEE Trans. Software Eng.	1995	DBLP DOI BibTeX RDF	regression trees and neural networks, machine learning, decision trees, Software development effort
17	Akhil Kumar 0001	G-Tree: A New Data Structure for Organizing Multidimensional Data.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	G-tree, multidimensional data organisation, grid tree, ordering property, multidimensional space, partition numbers, dynamic data spaces, nonuniform data distributions, deletion operations, BD tree, zkdb tree, KDB tree, simulated bucket utilization rates, data structure, trees (mathematics), range queries, B-trees, tree data structures, data handling
17	Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg	Scattering and Gathering Messages in Networks of Processors.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	message scattering, messages gathering, networks of processors, trees of processors, noncolliding paths, queueing mechanisms, scheduling, distributed processing, multiprocessor interconnection networks, spanning trees, buffering
17	Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang	Broadcasting on Incomplete Hypercubes.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	edge-disjoint spanning trees, delays, hypercube networks, trees (mathematics), broadcasting algorithm, incomplete hypercube, faulty nodes
17	Takushi Tanaka	Parsing Electronic Circuits in a Logic Grammar.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	trouble shooting, automatic circuit understanding, circuit structures, definite clause set grammar, DCSG top-down parsing mechanism, trees (mathematics), circuit analysis computing, grammars, structural analysis, formal logic, hierarchical structures, circuit design, words, parse trees, functional blocks, causal analysis, sentence, logic grammar
17	Theodore Johnson, Dennis E. Shasha	The Performance of Current B-Tree Algorithms.	ACM Trans. Database Syst.	1993	DBLP DOI BibTeX RDF	concurrent B-trees, performance of concurrent algorithms, B-trees, concurrent data structures
17	Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman	On the Fault Tolerance of Some Popular Bounded-Degree Networks	FOCS	1992	DBLP DOI BibTeX RDF	bounded-degree networks, worst-case faults, shuffle-exchange graph, constant-factor slowdown, routing packets, fault tolerance, parallel computation, hypercubic networks, binary trees, meshes of trees
17	Stephan Olariu, C. Michael Overstreet, Zhaofang Wen	An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals.	ICCI	1991	DBLP DOI BibTeX RDF	Algorithms, Parallel algorithms, PRAM, Binary trees, Traversals, Ordered trees
17	Hon Fung Li, David K. Probst	Optimal VLSI Dictionary Machines Without Compress Instructions.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	optimal VLSI dictionary machines, logarithmic network, design objectives, single-cycle operability, logarithmic network, VLSI, database management systems, trees (mathematics), special purpose computers, linear network, query trees
17	Krishna Kant 0001, A. Ravichandran	Synthesizing Robust Data STructures - An Introduction.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	robust data structures, data elements, concurrent repair, disjoint portions, databases, data structures, fault tolerant computing, synthesis, trees (mathematics), first-order logic, B-trees, attributes, axioms, formal approach
17	Ding-Zhu Du, Frank K. Hwang	An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio	FOCS	1990	DBLP DOI BibTeX RDF	concave function, lower bounds, minimum spanning trees, polytope, function minimization, continuous functions, Steiner ratio, Steiner minimum trees, Euclidean plane
17	David A. Carlson	Modified Mesh-Connected Parallel Computers.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	mesh-connected parallel computers, global mesh structures, tree computations, X-tree, parallel processing, sorting, trees (mathematics), interprocessor communication, application programs, pyramid, mesh-of-trees, prefix computations
16	Deepayan Chakrabarti, Rupesh R. Mehta	The paths more taken: matching DOM trees to search logs for accurate webpage clustering.	WWW	2010	DBLP DOI BibTeX RDF	clustering, wrapper induction, search logs
16	Hua Xiang 0001, Haoxing Ren, Louise Trevillyan, Lakshmi N. Reddy, Ruchir Puri, Minsik Cho	Logical and physical restructuring of fan-in trees.	ISPD	2010	DBLP DOI BibTeX RDF	symmetric-function fan-in tree, restructure, commutative
16	Arthur Shek, Dylan Lacewell, Andrew Selle, Daniel Teece, Tom Thompson	Art-directing Disney's Tangled procedural trees.	SIGGRAPH Talks	2010	DBLP DOI BibTeX RDF
16	Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF
16	Shigeo Takahashi, Issei Fujishiro, Masato Okada	Applying Manifold Learning to Plotting Approximate Contour Trees.	IEEE Trans. Vis. Comput. Graph.	2009	DBLP DOI BibTeX RDF
16	Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano	Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).	WALCOM	2009	DBLP DOI BibTeX RDF	family tree, algorithm, graph, enumeration, ordered tree
16	Michael A. Bender	From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.	SEA	2009	DBLP DOI BibTeX RDF