The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase P-trees (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1966 (18) 1967-1969 (17) 1970-1971 (21) 1972 (27) 1973 (22) 1974 (19) 1975 (37) 1976 (44) 1977 (36) 1978 (53) 1979 (62) 1980 (89) 1981 (105) 1982 (71) 1983 (134) 1984 (116) 1985 (121) 1986 (132) 1987 (152) 1988 (203) 1989 (222) 1990 (265) 1991 (303) 1992 (283) 1993 (287) 1994 (370) 1995 (397) 1996 (450) 1997 (485) 1998 (469) 1999 (596) 2000 (612) 2001 (641) 2002 (800) 2003 (930) 2004 (1109) 2005 (1223) 2006 (1339) 2007 (1311) 2008 (1317) 2009 (1222) 2010 (756) 2011 (757) 2012 (812) 2013 (737) 2014 (728) 2015 (816) 2016 (851) 2017 (879) 2018 (837) 2019 (919) 2020 (1025) 2021 (1034) 2022 (1062) 2023 (998) 2024 (250)
Publication types (Num. hits)
article(13419) book(25) data(3) incollection(228) inproceedings(14658) phdthesis(224) proceedings(14)
Venues (Conferences, Journals, ...)
CoRR(2263) Discret. Math.(480) Discret. Appl. Math.(394) Inf. Process. Lett.(314) Theor. Comput. Sci.(311) Algorithmica(238) SODA(222) CAAP(207) SIAM J. Comput.(165) ICALP(162) ISAAC(154) Remote. Sens.(152) Electron. J. Comb.(141) FOCS(141) J. Graph Theory(140) Bioinform.(135) More (+10 of total 4014)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11308 occurrences of 4427 keywords

Results
Found 28581 publication records. Showing 28571 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
82Karel Culík II, Thomas Ottmann, Derick Wood Dense Multiway Trees. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF dense trees, multiway trees, storage utilization, B-trees, search trees, balanced trees
73William E. Wright Dynamic Binary Search Trees. Search on Bibsonomy ACM Annual Conference (1) The full citation details ... 1978 DBLP  DOI  BibTeX  RDF BB trees, Dynamic trees, Optimal trees, Weighted path length, Weighted trees, Binary search trees, AVL trees
71Jun Rao, Kenneth A. Ross Making B+-Trees Cache Conscious in Main Memory. Search on Bibsonomy SIGMOD Conference The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
57Zhiheng Huang, Masoud Nikravesh, Ben Azvine, Tamás D. Gedeon Weighted Pattern Trees: A Case Study with Customer Satisfaction Dataset. Search on Bibsonomy IFSA (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
55David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001 Representing Trees of Higher Degree. Search on Bibsonomy Algorithmica The full citation details ... 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
55Joaquim Gabarró, Xavier Messeguer, Daniel Riu Concurrent Rebalancing on HyperRed-Black Trees. Search on Bibsonomy SCCC The full citation details ... 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
51Sangyong Hwang, Keunjoo Kwon, Sang Kyun Cha, Byung Suk Lee 0001 Performance Evaluation of Main-Memory R-tree Variants. Search on Bibsonomy SSTD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
51Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas 10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. Search on Bibsonomy Advances and Applications of Automata on Words and Trees The full citation details ... 2010 DBLP  BibTeX  RDF
51Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas 10501 Executive Summary - Advances and Applications of Automata on Words and Trees. Search on Bibsonomy Advances and Applications of Automata on Words and Trees The full citation details ... 2010 DBLP  BibTeX  RDF
50Michael Benedikt, Leonid Libkin, Frank Neven Logical definability and query languages over ranked and unranked trees. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ranked trees, unranked trees, query languages, tree automata, model theory
50Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shimodaira A visualization tool for interactive learning of large decision trees. Search on Bibsonomy ICTAI The full citation details ... 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
50Zicheng Guo, Rami G. Melhem Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
50Richard W. Selby, Adam A. Porter Learning from Examples: Generation and Evaluation of Decision Trees for Software Resource Analysis. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 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
50Rudolf Bayer, Karl Unterauer Prefix B-Trees. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1977 DBLP  DOI  BibTeX  RDF multiway search trees, B-trees, key compression
45Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang The emulation problem on trees. Search on Bibsonomy IPPS The full citation details ... 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
45Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas (eds.) Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010 Search on Bibsonomy Advances and Applications of Automata on Words and Trees The full citation details ... 2010 DBLP  BibTeX  RDF
45Alexander Okhotin, Christian Reitwießner Parsing Unary Boolean Grammars Using Online Convolution. Search on Bibsonomy Advances and Applications of Automata on Words and Trees The full citation details ... 2010 DBLP  BibTeX  RDF
44Shimin Chen, Phillip B. Gibbons, Todd C. Mowry, Gary Valentin Fractal prefetching B±Trees: optimizing both cache and disk performance. Search on Bibsonomy SIGMOD Conference The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
44Vance E. Waddle Production Trees: A Compact Representation of Parsed Programs. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
44Jason Cong, Cheng-Kok Koh Interconnect layout optimization under higher-order RLC model. Search on Bibsonomy ICCAD The full citation details ... 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
43Jakub Koperwas, Krzysztof Walczak 0002 Frequent Subsplit Representation of Leaf-Labelled Trees. Search on Bibsonomy EvoBIO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Leaf-labelled trees, frequent subsplits, phylogenetic trees
43Manuel Gómez-Olmedo, Andrés Cano Applying Numerical Trees to Evaluate Asymmetric Decision Problems. Search on Bibsonomy ECSQARU The full citation details ... 2003 DBLP  DOI  BibTeX  RDF asymmetric decision problems, numerical trees, probability trees, Influence diagrams
43Bryant A. Julstrom, Günther R. Raidl Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. Search on Bibsonomy SAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF random spanning trees, sets of edges, spanning trees, initialization
43Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar On generalized fat trees. Search on Bibsonomy IPPS The full citation details ... 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
42Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky A new perspective on implementation by voting trees. Search on Bibsonomy EC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF copeland rule, voting trees, approximation, computational social choice
41YunMei Dong Linear algorithm for lexicographic enumeration of CFG parse trees. Search on Bibsonomy Sci. China Ser. F Inf. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF hierarchical construction of set of parse trees, lexicographic enumeration of parse trees, counting of parse trees
41Eiichi Tanaka A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 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
41Sheela Ramanna, Rajen Bhatt, Piotr Biernot Software Defect Classification: A Comparative Study with Rough Hybrid Approaches. Search on Bibsonomy RSEISP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF rough-fuzzy classification trees, neuro-fuzzy decision trees, Classification, rough sets, software defects
40Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi A Bijective Code for k -Trees with Linear Time Encoding and Decoding. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Robert Endre Tarjan Results and Problems on Self-adjusting Search Trees and Related Data Structures. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Leonid Libkin, Frank Neven Logical Definability and Query Languages over Unranked Trees. Search on Bibsonomy LICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
40David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman 0001 Representing Trees of Higer Degree. Search on Bibsonomy WADS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
40Shou-Hsuan Stephen Huang Height-Balanced Trees of Order (beta,gamma,delta). Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
40Hillol Kargupta, Byung-Hoon Park, Haimonti Dutta Orthogonal Decision Trees. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Orthogonal decision trees, redundancy free trees, Fourier transform, principle component analysis
40Nicholas Georgiou Embeddings and Other Mappings of Rooted Trees Into Complete Trees. Search on Bibsonomy Order The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
39Chin-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. Search on Bibsonomy IPPS The full citation details ... 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
39Alexandros Kalousis, Melanie Hilario Model selection via meta-learning: a comparative study. Search on Bibsonomy ICTAI The full citation details ... 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
38Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral Binary Probability Trees for Bayesian Networks Inference. Search on Bibsonomy ECSQARU The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bayesian networks inference, variable elimination algorithm, probability trees, deterministic algorithms, approximate computation
38Dong Kyue Kim, Minhwan Kim, Heejin Park Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Index data structures, Suffix trees, Suffix arrays, String algorithms
38Amalia Duch Randomized Insertion and Deletion in Point Quad Trees. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Randomized Algorithms, Quad trees
38Evgeny Dantsin, Andrei Voronkov Expressive Power and Data Complexity of Query Languages for Trees and Lists. Search on Bibsonomy PODS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF trees, expressive power, lists, data complexity, term algebras
38Jason Tsong-Li Wang, Bruce A. Shapiro, Dennis E. Shasha, Kaizhong Zhang, Kathleen M. Currey An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF pattern recognition, dynamic programming, pattern matching, trees, Computational biology
38Marc Mosko, J. J. Garcia-Luna-Aceves An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees. Search on Bibsonomy ICNP The full citation details ... 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
38Floriana Esposito, Donato Malerba, Giovanni Semeraro A Comparative Analysis of Methods for Pruning Decision Trees. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 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
37Milena Mihail, Christos Kaklamanis, Satish Rao Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. Search on Bibsonomy FOCS The full citation details ... 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
37Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan Nearly Tight Bounds on the Learnability of Evolution. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF nearly tight bounds, evolution learnability, Cavender-Farris trees, edge weighted trees, Phylogeny Construction Problem, CF tree, computationally expensive, genetic algorithms, maximum likelihood estimator, stochastic process, DNA, convergence rate, random variable
37Mukul S. Bansal, Jianrong Dong, David Fernández-Baca Comparing and Aggregating Partially Resolved Trees. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
37Robert Endre Tarjan, Renato Fonseca F. Werneck Self-adjusting top trees. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
36Jakub Koperwas, Krzysztof Walczak 0002 Phylogenetic Trees Dissimilarity Measure Based on Strict Frequent Splits Set and Its Application for Clustering. Search on Bibsonomy RSKT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Leaf-labelled trees, Frequent subsplits, Clustering, Phylogenetic trees
36Ander Murua The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series. Search on Bibsonomy Found. Comput. Math. The full citation details ... 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
36Stavros D. Nikolopoulos, Charis Papadopoulos The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
36Isamu Shioya, Takao Miura Knowledge pruning in decision trees. Search on Bibsonomy ICTAI The full citation details ... 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
36Vijay S. Iyengar HOT: Heuristics for Oblique Trees. Search on Bibsonomy ICTAI The full citation details ... 1999 DBLP  DOI  BibTeX  RDF oblique trees, data mining, machine learning, classification, decision trees
36Rudolf Bayer, J. K. Metzger On the Encipherment of Search Trees and Random Access Files. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF encipherment, indexed sequential files, privacy transformation, random access files, security, privacy, cryptography, indexes, paging, protection, B-trees, search trees
36Céline Scornavacca, Vincent Berry, Vincent Ranwez From Gene Trees to Species Trees through a Supertree Approach. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Antonio Corral, Manuel Torres 0001, Michael Vassilakopoulos, Yannis Manolopoulos Predictive Join Processing between Regions and Moving Objects. Search on Bibsonomy ADBIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF TPR-trees, linear quad-trees, query processing, Moving objects, R-trees, joins
35Atsuhiro Takasu, Shin'ichi Satoh 0001, Eishi Katsura A rule learning method for academic document image processing. Search on Bibsonomy ICDAR The full citation details ... 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
35Jonathan Schaeffer The History Heuristic and Alpha-Beta Search Enhancements in Practice. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 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
35Giridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis Maintaining colored trees for disjoint multipath routing under node failures. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF IP fast rerouting, colored trees, multipath routing
35Martin Graham 0001, Jessie B. Kennedy Exploring Multiple Trees through DAG Representations. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Multiple trees, Directed Acyclic Graph
35Siegfried Nijssen, Élisa Fromont Mining optimal decision trees from itemset lattices. Search on Bibsonomy KDD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF decision trees, frequent itemsets, constraint-based mining, formal concepts
35Renato Fernandes Hentschke, Jaganathan Narasimham, Marcelo O. Johann, Ricardo Augusto da Luz Reis Maze routing steiner trees with effective critical sink optimization. Search on Bibsonomy ISPD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF timing driven synthesis, Steiner trees, maze routing
35Wan Nazmee Wan Zainon, Paul R. Calder Visualising phylogenetic trees. Search on Bibsonomy AUIC The full citation details ... 2006 DBLP  BibTeX  RDF interactive visualisation, bioinformatics, phylogenetic trees
35Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Quartet distance, Distance measures, Evolutionary trees, Hierarchical decompositions
35Donato Malerba, Floriana Esposito, Michelangelo Ceci, Annalisa Appice Top-Down Induction of Model Trees with Regression and Splitting Nodes. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF global and local effects, regression and splitting nodes, SMOTI, linear regression, Inductive learning, model trees
35Alexandre Riazanov, Andrei Voronkov Partially Adaptive Code Trees. Search on Bibsonomy JELIA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF term indexing, code trees, matching, automated theorem proving, subsumption
35Alois Panholzer, Helmut Prodinger Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. Search on Bibsonomy Algorithmica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Priority trees, Height of nodes, Generating functions, Path length
34Beomseok Nam, Alan Sussman A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets. Search on Bibsonomy SSDBM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter A Framework for Index Bulk Loading and Dynamization. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Milan Zorman, Vili Podgorelec, Peter Kokol, Margaret G. E. Peterson, Joseph M. Lane Decision Tree's Induction Strategies Evaluated on a Hard Real World Problem. Search on Bibsonomy CBMS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF evolutionary decision trees, orthopaedic fracture data, decision trees, hybrid methods
33Yuval Emek k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Hosam M. Mahmoud The size of random bucket trees via urn models. Search on Bibsonomy Acta Informatica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Neal Glew A Theory of Second-Order Trees. Search on Bibsonomy ESOP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Conrado Martinez, Alois Panholzer, Helmut Prodinger Partial Match Queries in Relaxed Multidimensional Search Trees. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
33Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting A Faster and Unifying Algorithm for Comparing Trees. Search on Bibsonomy CPM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
33Daniel Dominic Sleator, Robert Endre Tarjan Self-Adjusting Binary Search Trees Search on Bibsonomy J. ACM The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
33Vijay K. Vaishnavi Computing Point Enclosures. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 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
33Paolo Penna, Carmine Ventre Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. Search on Bibsonomy PE-WASUN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees
33Kazuhiko Kato Persistently Cached B-Trees. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF B^+-trees, secondary storage management, persistent caching, replication, database management system, B-trees, complex objects, indexing structure
33Hussein A. Abbass, Michael Towsey, Gerard D. Finn C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF C5, Multivariate decision trees, Univariate decision trees, Neural networks
33Yuan Gao, Ye Ge, Jennifer C. Hou RMCM: Reliable Multicasts for Core-based Multicast Trees. Search on Bibsonomy ICNP The full citation details ... 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
33Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract). Search on Bibsonomy Euro-Par The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms
33Fabrizio Petrini, Marco Vanneschi k -ary n -trees: High Performance Networks for Massively Parallel Architectures. Search on Bibsonomy IPPS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF k-ary n-trees, flowcontrol, congestion-free patterns, routing, Interconnection networks, virtual channels, fat-trees
33Renzo Sprugnoli The Generation of Binary Trees as a Numerical Problem. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF generation of binary trees, binary trees
33Ig-hoon Lee, Junho Shim, Sang-goo Lee, Jonghoon Chun CST-Trees: Cache Sensitive T-Trees. Search on Bibsonomy DASFAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Alicja Wieczorkowska, Zbigniew W. Ras, Li-Shiang Tsay Representing Audio Data by FS-Trees and Adaptable TV-Trees. Search on Bibsonomy ISMIS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Vincent Berry, François Nicolas Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics
32Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
32David M. Arnow, Aaron M. Tenenbaum An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees. Search on Bibsonomy SIGMOD Conference The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
32Andreas Brandstädt, Van Bang Le, R. Sritharan Structure and linear-time recognition of 4-leaf powers. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF squares of trees, trees, phylogenetic trees, leaf powers, Graph powers
32Hanan Samet Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF BV-trees, PK-trees, space decomposition, R-trees, decoupling, Spatial indexing, object hierarchies
32Tao Yang 0009, Apostolos Gerasoulis DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 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
32Celine Vens, Jan Struyf, Leander Schietgat, Saso Dzeroski, Hendrik Blockeel Decision trees for hierarchical multi-label classification. Search on Bibsonomy Mach. Learn. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Precision-recall analysis, Decision trees, Hierarchical classification, Multi-label classification, Functional genomics
32Anna Kasprzik A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness. Search on Bibsonomy ICGI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF MAT learning, multi-dimensional trees, finite-state
32Albert Bifet, Ricard Gavaldà Mining adaptively frequent closed unlabeled rooted trees in data streams. Search on Bibsonomy KDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF closed mining, data streams, patterns, trees, concept drift
32Joseph Cheriyan, Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems
32Adrian Rusu, Radu Jianu, Confesor Santiago, Christopher Clement An experimental study on algorithms for drawing binary trees. Search on Bibsonomy APVIS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF drawing algorithm, binary trees, experimental study, planar, straight-line
32Kirsten Winter Formalising Behaviour Trees with CSP. Search on Bibsonomy IFM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Behaviour Trees, model checking, Requirements engineering, CSP
32Wim Pijls, Arie de Bruin Game Tree Algorithms and Solution Trees. Search on Bibsonomy Computers and Games The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Game tree search, Minimax search, Solution trees, Alpha-beta, SSS*, MTD
32Kim S. Larsen, Rolf Fagerberg B-trees with relaxed balance. Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF relaxed balance, shared-memory asynchronous parallel architectures, rebalancing, extensive locking, maximal size, parallel architectures, B-trees, tree data structures, subtree
Displaying result #1 - #100 of 28571 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license