|
|
Venues (Conferences, Journals, ...)
|
|
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 |
82 | Karel Culík II, Thomas Ottmann, Derick Wood |
Dense Multiway Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 6(3), pp. 486-512, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
dense trees, multiway trees, storage utilization, B-trees, search trees, balanced trees |
73 | William E. Wright |
Dynamic Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (1) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume I, pp. 370-374, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
BB trees, Dynamic trees, Optimal trees, Weighted path length, Weighted trees, Binary search trees, AVL trees |
71 | Jun Rao, Kenneth A. Ross |
Making B+-Trees Cache Conscious in Main Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA., pp. 475-486, 2000, ACM, 1-58113-217-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
57 | Zhiheng Huang, Masoud Nikravesh, Ben Azvine, Tamás D. Gedeon |
Weighted Pattern Trees: A Case Study with Customer Satisfaction Dataset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFSA (1) ![In: Foundations of Fuzzy Logic and Soft Computing, 12th International Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Mexico, June 18-21, 2007, Proceedings, pp. 395-406, 2007, Springer, 978-3-540-72917-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
55 | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001 |
Representing Trees of Higher Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(4), pp. 275-292, 2005. The full citation details ...](Pics/full.jpeg) |
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 |
55 | Joaquim Gabarró, Xavier Messeguer, Daniel Riu |
Concurrent Rebalancing on HyperRed-Black Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), November 12-14, 1997, Valpariso, Chile, pp. 93-104, 1997, IEEE Computer Society, 0-8186-8052-0. The full citation details ...](Pics/full.jpeg) |
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 |
51 | Sangyong Hwang, Keunjoo Kwon, Sang Kyun Cha, Byung Suk Lee 0001 |
Performance Evaluation of Main-Memory R-tree Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSTD ![In: Advances in Spatial and Temporal Databases, 8th International Symposium, SSTD 2003, Santorini Island, Greece, July 24-27, 2003, Proceedings, pp. 10-27, 2003, Springer, 3-540-40535-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Christian 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](Pics/bibsonomy.png) |
Advances and Applications of Automata on Words and Trees ![In: Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
51 | Christian 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](Pics/bibsonomy.png) |
Advances and Applications of Automata on Words and Trees ![In: Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
50 | Michael Benedikt, Leonid Libkin, Frank Neven |
Logical definability and query languages over ranked and unranked trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(2), pp. 11, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ranked trees, unranked trees, query languages, tree automata, model theory |
50 | Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shimodaira |
A visualization tool for interactive learning of large decision trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, pp. 28-35, 2000, IEEE Computer Society, 0-7695-0909-6. The full citation details ...](Pics/full.jpeg) |
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 |
50 | Zicheng Guo, Rami G. Melhem |
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(6), pp. 664-672, 1994. The full citation details ...](Pics/full.jpeg) |
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 |
50 | Richard W. Selby, Adam A. Porter |
Learning from Examples: Generation and Evaluation of Decision Trees for Software Resource Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(12), pp. 1743-1757, 1988. The full citation details ...](Pics/full.jpeg) |
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 |
50 | Rudolf Bayer, Karl Unterauer |
Prefix B-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 2(1), pp. 11-26, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
multiway search trees, B-trees, key compression |
45 | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
The emulation problem on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 251-255, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
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 |
45 | Christian 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](Pics/bibsonomy.png) |
Advances and Applications of Automata on Words and Trees ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
45 | Alexander Okhotin, Christian Reitwießner |
Parsing Unary Boolean Grammars Using Online Convolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances and Applications of Automata on Words and Trees ![In: Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
44 | Shimin Chen, Phillip B. Gibbons, Todd C. Mowry, Gary Valentin |
Fractal prefetching B±Trees: optimizing both cache and disk performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, USA, June 3-6, 2002, pp. 157-168, 2002, ACM, 1-58113-497-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Vance E. Waddle |
Production Trees: A Compact Representation of Parsed Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 12(1), pp. 61-83, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
44 | Jason Cong, Cheng-Kok Koh |
Interconnect layout optimization under higher-order RLC model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 713-720, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
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 |
43 | Jakub Koperwas, Krzysztof Walczak 0002 |
Frequent Subsplit Representation of Leaf-Labelled Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoBIO ![In: Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, 6th European Conference, EvoBIO 2008, Naples, Italy, March 26-28, 2008. Proceedings, pp. 95-105, 2008, Springer, 978-3-540-78756-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Leaf-labelled trees, frequent subsplits, phylogenetic trees |
43 | Manuel Gómez-Olmedo, Andrés Cano |
Applying Numerical Trees to Evaluate Asymmetric Decision Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 7th European Conference, ECSQARU 2003, Aalborg, Denmark, July 2-5, 2003. Proceedings, pp. 196-207, 2003, Springer, 3-540-40494-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
asymmetric decision problems, numerical trees, probability trees, Influence diagrams |
43 | Bryant A. Julstrom, Günther R. Raidl |
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), March 10-14, 2002, Madrid, Spain, pp. 547-552, 2002, ACM, 1-58113-445-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
random spanning trees, sets of edges, spanning trees, initialization |
43 | Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar |
On generalized fat trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 37-44, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
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 |
42 | Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky |
A new perspective on implementation by voting trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 31-40, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
copeland rule, voting trees, approximation, computational social choice |
41 | YunMei Dong |
Linear algorithm for lexicographic enumeration of CFG parse trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 52(7), pp. 1177-1202, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hierarchical construction of set of parse trees, lexicographic enumeration of parse trees, counting of parse trees |
41 | Eiichi Tanaka |
A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(12), pp. 1233-1238, 1994. The full citation details ...](Pics/full.jpeg) |
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 |
41 | Sheela Ramanna, Rajen Bhatt, Piotr Biernot |
Software Defect Classification: A Comparative Study with Rough Hybrid Approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSEISP ![In: Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28-30, 2007, Proceedings, pp. 630-638, 2007, Springer, 978-3-540-73450-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
rough-fuzzy classification trees, neuro-fuzzy decision trees, Classification, rough sets, software defects |
40 | Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi |
A Bijective Code for k -Trees with Linear Time Encoding and Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 408-420, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Robert Endre Tarjan |
Results and Problems on Self-adjusting Search Trees and Related Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 2, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Leonid Libkin, Frank Neven |
Logical Definability and Query Languages over Unranked Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 178-187, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
40 | David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman 0001 |
Representing Trees of Higer Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 169-180, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Shou-Hsuan Stephen Huang |
Height-Balanced Trees of Order (beta,gamma,delta). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 10(2), pp. 261-284, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
40 | Hillol Kargupta, Byung-Hoon Park, Haimonti Dutta |
Orthogonal Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 18(8), pp. 1028-1042, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Orthogonal decision trees, redundancy free trees, Fourier transform, principle component analysis |
40 | Nicholas Georgiou |
Embeddings and Other Mappings of Rooted Trees Into Complete Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(3), pp. 257-288, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 603-607, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
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 |
39 | Alexandros Kalousis, Melanie Hilario |
Model selection via meta-learning: a comparative study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, pp. 406-413, 2000, IEEE Computer Society, 0-7695-0909-6. The full citation details ...](Pics/full.jpeg) |
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 |
38 | Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral |
Binary Probability Trees for Bayesian Networks Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 10th European Conference, ECSQARU 2009, Verona, Italy, July 1-3, 2009. Proceedings, pp. 180-191, 2009, Springer, 978-3-642-02905-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bayesian networks inference, variable elimination algorithm, probability trees, deterministic algorithms, approximate computation |
38 | Dong 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](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(3), pp. 350-377, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Index data structures, Suffix trees, Suffix arrays, String algorithms |
38 | Amalia Duch |
Randomized Insertion and Deletion in Point Quad Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 415-426, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Randomized Algorithms, Quad trees |
38 | Evgeny Dantsin, Andrei Voronkov |
Expressive Power and Data Complexity of Query Languages for Trees and Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-17, 2000, Dallas, Texas, USA, pp. 157-165, 2000, ACM, 1-58113-214-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
trees, expressive power, lists, data complexity, term algebras |
38 | Jason 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](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(8), pp. 889-895, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
pattern recognition, dynamic programming, pattern matching, trees, Computational biology |
38 | Marc Mosko, J. J. Garcia-Luna-Aceves |
An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Eighth Annual International Conference on Network Protocols, ICNP 2000, 14-17 November, 2000, Osaka, Japan, pp. 151-164, 2000, IEEE Computer Society, 0-7695-0921-5. The full citation details ...](Pics/full.jpeg) |
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 |
38 | Floriana Esposito, Donato Malerba, Giovanni Semeraro |
A Comparative Analysis of Methods for Pruning Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 19(5), pp. 476-491, 1997. The full citation details ...](Pics/full.jpeg) |
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 |
37 | Milena Mihail, Christos Kaklamanis, Satish Rao |
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 548-557, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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 |
37 | Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan |
Nearly Tight Bounds on the Learnability of Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 524-533, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
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 |
37 | Mukul S. Bansal, Jianrong Dong, David Fernández-Baca |
Comparing and Aggregating Partially Resolved Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 72-83, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Robert Endre Tarjan, Renato Fonseca F. Werneck |
Self-adjusting top trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 813-822, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
36 | Jakub Koperwas, Krzysztof Walczak 0002 |
Phylogenetic Trees Dissimilarity Measure Based on Strict Frequent Splits Set and Its Application for Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 17-19, 2008. Proceedings, pp. 604-611, 2008, Springer, 978-3-540-79720-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Leaf-labelled trees, Frequent subsplits, Clustering, Phylogenetic trees |
36 | Ander Murua |
The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 6(4), pp. 387-426, 2006. The full citation details ...](Pics/full.jpeg) |
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 |
36 | Stavros D. Nikolopoulos, Charis Papadopoulos |
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 383-397, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems |
36 | Isamu Shioya, Takao Miura |
Knowledge pruning in decision trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, pp. 40-, 2000, IEEE Computer Society, 0-7695-0909-6. The full citation details ...](Pics/full.jpeg) |
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 |
36 | Vijay S. Iyengar |
HOT: Heuristics for Oblique Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 11th IEEE International Conference on Tools with Artificial Intelligence, ICTAI '99, Chicago, Illinois, USA, November 8-10, 1999, pp. 91-98, 1999, IEEE Computer Society, 0-7695-0456-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
oblique trees, data mining, machine learning, classification, decision trees |
36 | Rudolf Bayer, J. K. Metzger |
On the Encipherment of Search Trees and Random Access Files. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 1(1), pp. 37-52, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
encipherment, indexed sequential files, privacy transformation, random access files, security, privacy, cryptography, indexes, paging, protection, B-trees, search trees |
36 | Céline Scornavacca, Vincent Berry, Vincent Ranwez |
From Gene Trees to Species Trees through a Supertree Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp. 702-714, 2009, Springer, 978-3-642-00981-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Antonio Corral, Manuel Torres 0001, Michael Vassilakopoulos, Yannis Manolopoulos |
Predictive Join Processing between Regions and Moving Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADBIS ![In: Advances in Databases and Information Systems, 12th East European Conference, ADBIS 2008, Pori, Finland, September 5-9, 2008. Proceedings, pp. 46-61, 2008, Springer, 978-3-540-85712-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
TPR-trees, linear quad-trees, query processing, Moving objects, R-trees, joins |
35 | Atsuhiro Takasu, Shin'ichi Satoh 0001, Eishi Katsura |
A rule learning method for academic document image processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 239-242, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
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 |
35 | Jonathan Schaeffer |
The History Heuristic and Alpha-Beta Search Enhancements in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(11), pp. 1203-1212, 1989. The full citation details ...](Pics/full.jpeg) |
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 |
35 | Giridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis |
Maintaining colored trees for disjoint multipath routing under node failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(1), pp. 346-359, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
IP fast rerouting, colored trees, multipath routing |
35 | Martin Graham 0001, Jessie B. Kennedy |
Exploring Multiple Trees through DAG Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 13(6), pp. 1294-1301, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multiple trees, Directed Acyclic Graph |
35 | Siegfried Nijssen, Élisa Fromont |
Mining optimal decision trees from itemset lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12-15, 2007, pp. 530-539, 2007, ACM, 978-1-59593-609-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
decision trees, frequent itemsets, constraint-based mining, formal concepts |
35 | Renato Fernandes Hentschke, Jaganathan Narasimham, Marcelo O. Johann, Ricardo Augusto da Luz Reis |
Maze routing steiner trees with effective critical sink optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2007 International Symposium on Physical Design, ISPD 2007, Austin, Texas, USA, March 18-21, 2007, pp. 135-142, 2007, ACM, 978-1-59593-613-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
timing driven synthesis, Steiner trees, maze routing |
35 | Wan Nazmee Wan Zainon, Paul R. Calder |
Visualising phylogenetic trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AUIC ![In: User Interfaces 2006, 7th Australasian User Interface Conference (AUIC 2006), Hobart, Tasmania, Australia, January 16-19 2005, pp. 145-152, 2006, Australian Computer Society, 1-920682-32-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
interactive visualisation, bioinformatics, phylogenetic trees |
35 | Gerth 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](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(2), pp. 377-395, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Quartet distance, Distance measures, Evolutionary trees, Hierarchical decompositions |
35 | Donato Malerba, Floriana Esposito, Michelangelo Ceci, Annalisa Appice |
Top-Down Induction of Model Trees with Regression and Splitting Nodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(5), pp. 612-625, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
global and local effects, regression and splitting nodes, SMOTI, linear regression, Inductive learning, model trees |
35 | Alexandre Riazanov, Andrei Voronkov |
Partially Adaptive Code Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000, Proceedings, pp. 209-223, 2000, Springer, 3-540-41131-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
term indexing, code trees, matching, automated theorem proving, subsumption |
35 | Alois Panholzer, Helmut Prodinger |
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(4), pp. 600-630, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Priority trees, Height of nodes, Generating functions, Path length |
34 | Beomseok Nam, Alan Sussman |
A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 21-23 June 2004, Santorini Island, Greece, pp. 171-180, 2004, IEEE Computer Society, 0-7695-2146-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
A Framework for Index Bulk Loading and Dynamization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 115-127, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Milan 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](Pics/bibsonomy.png) |
CBMS ![In: 13th IEEE Symposium on Computer-Based Medical Systems (CBMS 2000), 23-24 June 2000, Houston, TX, USA, pp. 19-24, 2000, IEEE Computer Society, 0-7695-0484-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
evolutionary decision trees, orthopaedic fracture data, decision trees, hybrid methods |
33 | Yuval Emek |
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 203-214, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Hosam M. Mahmoud |
The size of random bucket trees via urn models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 38(11/12), pp. 813-838, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Neal Glew |
A Theory of Second-Order Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 11th European Symposium on Programming, ESOP 2002, held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002, Proceedings, pp. 147-161, 2002, Springer, 3-540-43363-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Conrado Martinez, Alois Panholzer, Helmut Prodinger |
Partial Match Queries in Relaxed Multidimensional Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(1), pp. 181-204, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
A Faster and Unifying Algorithm for Comparing Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 129-142, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Daniel Dominic Sleator, Robert Endre Tarjan |
Self-Adjusting Binary Search Trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(3), pp. 652-686, July 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
33 | Vijay K. Vaishnavi |
Computing Point Enclosures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 31(1), pp. 22-29, 1982. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Paolo Penna, Carmine Ventre |
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2004, Venezia, Italy, October 4, 2004, pp. 61-68, 2004, ACM, 1-58113-959-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees |
33 | Kazuhiko Kato |
Persistently Cached B-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(3), pp. 706-720, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
B^+-trees, secondary storage management, persistent caching, replication, database management system, B-trees, complex objects, indexing structure |
33 | Hussein A. Abbass, Michael Towsey, Gerard D. Finn |
C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 3(2), pp. 184-197, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
C5, Multivariate decision trees, Univariate decision trees, Neural networks |
33 | Yuan Gao, Ye Ge, Jennifer C. Hou |
RMCM: Reliable Multicasts for Core-based Multicast Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Eighth Annual International Conference on Network Protocols, ICNP 2000, 14-17 November, 2000, Osaka, Japan, pp. 83-94, 2000, IEEE Computer Society, 0-7695-0921-5. The full citation details ...](Pics/full.jpeg) |
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 |
33 | Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel |
Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 421-429, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms |
33 | Fabrizio Petrini, Marco Vanneschi |
k -ary n -trees: High Performance Networks for Massively Parallel Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 87-, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
k-ary n-trees, flowcontrol, congestion-free patterns, routing, Interconnection networks, virtual channels, fat-trees |
33 | Renzo Sprugnoli |
The Generation of Binary Trees as a Numerical Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(2), pp. 317-327, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
generation of binary trees, binary trees |
33 | Ig-hoon Lee, Junho Shim, Sang-goo Lee, Jonghoon Chun |
CST-Trees: Cache Sensitive T-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings, pp. 398-409, 2007, Springer, 978-3-540-71702-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Alicja Wieczorkowska, Zbigniew W. Ras, Li-Shiang Tsay |
Representing Audio Data by FS-Trees and Adaptable TV-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 14th International Symposium, ISMIS 2003, Maebashi City, Japan, October 28-31, 2003, Proceedings, pp. 135-142, 2003, Springer, 3-540-20256-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Vincent Berry, François Nicolas |
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(3), pp. 289-302, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics |
32 | Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger |
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(3-4), pp. 367-407, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | David M. Arnow, Aaron M. Tenenbaum |
An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, USA, June 18-21, 1984, pp. 33-46, 1984, ACM Press, 978-0-89791-128-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
32 | Andreas Brandstädt, Van Bang Le, R. Sritharan |
Structure and linear-time recognition of 4-leaf powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(1), pp. 11:1-11:22, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
squares of trees, trees, phylogenetic trees, leaf powers, Graph powers |
32 | Hanan Samet |
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 29(4), pp. 789-830, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
BV-trees, PK-trees, space decomposition, R-trees, decoupling, Spatial indexing, object hierarchies |
32 | Tao Yang 0009, Apostolos Gerasoulis |
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(9), pp. 951-967, 1994. The full citation details ...](Pics/full.jpeg) |
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 |
32 | Celine Vens, Jan Struyf, Leander Schietgat, Saso Dzeroski, Hendrik Blockeel |
Decision trees for hierarchical multi-label classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 73(2), pp. 185-214, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Precision-recall analysis, Decision trees, Hierarchical classification, Multi-label classification, Functional genomics |
32 | Anna Kasprzik |
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings, pp. 111-124, 2008, Springer, 978-3-540-88008-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
MAT learning, multi-dimensional trees, finite-state |
32 | Albert Bifet, Ricard Gavaldà |
Mining adaptively frequent closed unlabeled rooted trees in data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 34-42, 2008, ACM, 978-1-60558-193-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
closed mining, data streams, patterns, trees, concept drift |
32 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(1), pp. 21-43, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems |
32 | Adrian Rusu, Radu Jianu, Confesor Santiago, Christopher Clement |
An experimental study on algorithms for drawing binary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APVIS ![In: Asia-Pacific Symposium on Information Visualisation, APVIS 2006, Tokyo, Japan, February 1-3, 2006, pp. 85-88, 2006, Australian Computer Society, 1-920682-41-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
drawing algorithm, binary trees, experimental study, planar, straight-line |
32 | Kirsten Winter |
Formalising Behaviour Trees with CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFM ![In: Integrated Formal Methods, 4th International Conference, IFM 2004, Canterbury, UK, April 4-7, 2004, Proceedings, pp. 148-167, 2004, Springer, 3-540-21377-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Behaviour Trees, model checking, Requirements engineering, CSP |
32 | Wim Pijls, Arie de Bruin |
Game Tree Algorithms and Solution Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, First International Conference, CG'98, Tsukuba, Japan, November 11-12, 1998, Proceedings, pp. 195-204, 1998, Springer, 3-540-65766-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Game tree search, Minimax search, Solution trees, Alpha-beta, SSS*, MTD |
32 | Kim S. Larsen, Rolf Fagerberg |
B-trees with relaxed balance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 196-202, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|