|
|
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 |
23 | Fabrizio Frati |
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot |
A First Investigation of Sturmian Trees. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Annalisa Appice, Saso Dzeroski |
Stepwise Induction of Multi-target Model Trees. |
ECML |
2007 |
DBLP DOI BibTeX RDF |
|
23 | James Allen Fill, Nevin Kapur, Alois Panholzer |
Destruction of Very Simple Trees. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Pang Ko, Srinivas Aluru |
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. |
CPM |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Sylvain Guillemot, François Nicolas |
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. |
CPM |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Gerth Stølting Brodal, Gabriel Moruz |
Skewed Binary Search Trees. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini |
The Myriad Virtues of Wavelet Trees. |
ICALP (1) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Peter J. Tan, David L. Dowe |
Decision Forests with Oblique Decision Trees. |
MICAI |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Liang Zhang 0014 |
Embedded Coding of the Motion-Compensated 3-D Wavelet Coefficients by Concatenating Spatial and Temporal Orientation Trees. |
ICME |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov |
Characterization of Unlabeled Level Planar Trees. |
GD |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Duncan E. Donohue, Giorgio A. Ascoli |
Local Diameter Fully Constrains Dendritic Size in Basal but not Apical Trees of CA1 Pyramidal Neurons. |
J. Comput. Neurosci. |
2005 |
DBLP DOI BibTeX RDF |
dendritic structure, pyramidal cells, computational models, morphology, three-dimensional reconstructions |
23 | Vijay Arya, Thierry Turletti, Shivkumar Kalyanaraman |
Encodings of Multicast Trees. |
NETWORKING |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Tetsuji Kuboyama, Kilho Shin, Tetsuhiro Miyahara, Hiroshi Yasuda |
A Theoretical Analysis of Alignment and Edit Problems for Trees. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Osamu Maruyama, Akiko Matsuda, Satoru Kuhara |
Reconstructing Phylogenetic Trees of Prokaryote Genomes by Randomly Sampling Oligopeptides. |
International Conference on Computational Science (2) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Hiroki Arimura, Takeaki Uno |
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. |
ILP |
2005 |
DBLP DOI BibTeX RDF |
frequent closed pattern mining, attribute tree, the least general generalization, description logic, semi-structured data, closure operation, tree mining, output-sensitive algorithm |
23 | César Fernández Peris, Sampsa Laine, Óscar Reinoso, Maria Asunción Vicente |
Improving the Readability of Decision Trees Using Reduced Complexity Feature Extraction. |
IEA/AIE |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Junfeng Tian, Yue Fu, Ying Xu, Jian-ling Wang |
Intrusion Detection Combining Multiple Decision Trees by Fuzzy logic. |
PDCAT |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela |
Fast Term Indexing with Coded Context Trees. |
J. Autom. Reason. |
2004 |
DBLP DOI BibTeX RDF |
term indexing, automated deduction |
23 | Alex Reche Martinez, Ignacio Martín 0002, George Drettakis |
Volumetric reconstruction and interactive rendering of trees from photographs. |
ACM Trans. Graph. |
2004 |
DBLP DOI BibTeX RDF |
visibility estimation, 3D reconstruction, interactive rendering |
23 | Daiji Fukagawa, Tatsuya Akutsu |
Fast Algorithms for Comparison of Similar Unordered Trees. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Shin-Ichi Nakano, Takeaki Uno |
Constant Time Generation of Trees with Specified Diameter. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood |
Partitions of Complete Geometric Graphs into Plane Trees. |
GD |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Harry Zhang, Jiang Su |
Conditional Independence Trees. |
ECML |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano |
Discovering Frequent Substructures in Large Unordered Trees. |
Discovery Science |
2003 |
DBLP DOI BibTeX RDF |
|
23 | A. J. Feelders, Martijn Pardoel |
Pruning for Monotone Classification Trees. |
IDA |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Olcay Boz |
Extracting decision trees from trained neural networks. |
KDD |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Toru Hasunuma |
Completely Independent Spanning Trees in Maximal Planar Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Stuart Kent 0001, John Howse |
Constraint Trees. |
Object Modeling with the OCL |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Nina Amenta, Jeff Klingner |
Case Study: Visualizing Sets of Evolutionary Trees. |
INFOVIS |
2002 |
DBLP DOI BibTeX RDF |
|
23 | David A. Helder, Sugih Jamin |
End-Host Multicast Communication Using Switch-Trees Protocols. |
CCGRID |
2002 |
DBLP DOI BibTeX RDF |
end-host multicast, peer-to-peer |
23 | Andrea Torsello, Edwin R. Hancock |
Learning Structural Variations in Shock Trees. |
SSPR/SPR |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Alexander Zelikovsky, Ion I. Mandoiu |
Practical approximation algorithms for zero- and bounded-skew trees. |
SODA |
2001 |
DBLP BibTeX RDF |
|
23 | Thomas Erlebach |
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Branko Kavsek, Nada Lavrac, Anuska Ferligoj |
Consensus Decision Trees: Using Consensus Hierarchical Clustering for Data Relabelling and Reduction. |
ECML |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Ben Curry, Geraint A. Wiggins, Gillian Hayes 0001 |
Representing Trees with Constraints. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Carsten Gutwenger, Petra Mutzel |
A Linear Time Implementation of SPQR-Trees. |
GD |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Byunggu Yu, Ratko Orlandic, Martha W. Evens |
Simple QSF-Trees: An Efficient and Scalable Spatial Access Method. |
CIKM |
1999 |
DBLP DOI BibTeX RDF |
point access methods, spatial database, database management, topological relations, spatial access methods |
23 | Andrzej Lingas, Hans Olsson, Anna Östlin |
Efficient Merging, Construction, and Maintenance of Evolutionary Trees. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Yoshiaki Kakuda, Kenji Ishida, Shinji Inoue, Kitsutaro Amano |
Resource Reservation for Multicast Trees Using Multiagents. |
RTCSA |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Ming-Yang Kao |
Tree Contractions and Evolutionary Trees. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Koji Obokata, Yukihiro Iwasaki, Feng Bao 0004, Yoshihide Igarashi |
Independent Spanning Trees of Product Graphs. |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Pierluigi Crescenzi, Paolo Penna |
Upward Drawings of Search Trees (Extended Abstract). |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Martin Farach, Teresa M. Przytycka, Mikkel Thorup |
Computing the Agreement of Trees with Bounded Degrees. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Marek Karpinski, Wojciech Rytter |
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Arvind Gupta, Naomi Nishimura |
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. |
SWAT |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Joachim Niehren, Andreas Podelski |
Feature Automata and Recognizable Sets of Feature Trees. |
TAPSOFT |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Samuel A. Rebelsky |
I/O Trees and Interactive Lazy Functional Programming. |
PLILP |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Dominique Barth |
An Algorithm of Broadcasting in the Mesh of Trees. |
CONPAR |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Bruce F. Naylor, John Amanatides, William C. Thibault |
Merging BSP trees yields polyhedral set operations. |
SIGGRAPH |
1990 |
DBLP DOI BibTeX RDF |
|
23 | James E. Rumbaugh |
State Trees as Structured Finite State Machines for User Interfaces. |
ACM Symposium on User Interface Software and Technology |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Udi Manber, Martin Tompa |
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
23 | Yongbin Jing, Liguan Wang, Lin Bi, Jianhong Chen |
Boolean Operations on Polygonal Meshes Using OBB Trees. |
ESIAT (1) |
2009 |
DBLP DOI BibTeX RDF |
intersection test, OBB trees, Boolean operations, polygonal meshes, BSP trees |
23 | Duncan Potts, Claude Sammut |
Incremental Learning of Linear Model Trees. |
Mach. Learn. |
2005 |
DBLP DOI BibTeX RDF |
linear regression trees, online learning, incremental learning, model trees |
23 | Heejin Park, Kunsoo Park, Yookun Cho |
Deleting Keys of B-trees in Parallel. |
IPDPS |
2002 |
DBLP DOI BibTeX RDF |
balanced search trees, dictionary operations, parallel algorithms, B-trees |
23 | Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas |
Optimal finger search trees in the pointer machine. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
finger search trees, update operations, complexity, data structures, balanced trees |
23 | Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang |
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. |
IEEE Trans. Parallel Distributed Syst. |
2000 |
DBLP DOI BibTeX RDF |
Depth-first search trees, parallel algorithms, spanning trees, PRAM, the Euler-tour technique |
23 | David R. Karger, Maria Minkoff |
Building Steiner Trees with Incomplete Global Knowledge. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
combinational switching, incomplete global knowledge, network usage minimization, data item distribution, data-requesting clients, connection probability, fixed data path specification, concave cost functions, open facilities, minimum demand, bicriterion approximation, assignment cost, trees (mathematics), Steiner trees, client-server systems, facility location, minimisation, approximation theory, uncertainty handling, facility location problem, economies of scale, vertex, network synthesis, network design problems |
23 | Yulu Ma, Shiduan Cheng |
Multi-Cores Uni-Directional Shared Trees Multicast Routing Protocol. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
multi-cores uni-directional shared trees, CBT, PIM-SM, intradomain multicast routing protocols, efficient member management mechanism, authentication, protocols, admission control, trees (mathematics), telecommunication network routing, multicast communication, multicast group, packet transmission |
23 | Ehud Aharoni, Reuven Cohen |
Restricted dynamic Steiner trees for scalable multicast in datagram networks. |
IEEE/ACM Trans. Netw. |
1998 |
DBLP DOI BibTeX RDF |
dynamic trees, routing scalability, Steiner trees, multicast routing |
23 | Giuseppe F. Italiano, Rajiv Ramaswami |
Maintaining Spanning Trees of Small Diameter. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
Design and analysis of algorithms and data structures, Design and analysis of algorithms and data structures, Spanning trees, Spanning trees, Key words |
23 | Bryant A. Julstrom |
Representing rectilinear Steiner trees in genetic algorithms. |
SAC |
1996 |
DBLP DOI BibTeX RDF |
genetic encodings, trees, spanning, rectilinear Steiner trees |
23 | Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honesty C. Young |
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins. |
IEEE Trans. Knowl. Data Eng. |
1995 |
DBLP DOI BibTeX RDF |
bushy trees, right-deep trees, Pipelining, parallel query processing, hash joins |
23 | Paul W. Fieguth, William W. Irving, Alan S. Willsky |
Multiresolution model development for overlapping trees via canonical correlation analysis. |
ICIP |
1995 |
DBLP DOI BibTeX RDF |
overlapping trees, multiscale stochastic models, Gaussian random processes, scale recursive dynamics, fast statistically optimal algorithm, tree nodes, estimation algorithm, optimal estimation results, error covariance information, statistics, image representation, trees (mathematics), error analysis, image resolution, Gaussian processes, random processes, estimation theory, multiresolution model, correlation methods, canonical correlation analysis, covariance analysis, multiscale representations, image pixel, image domain |
23 | Ing-Ray Chen, Salah Hassan |
Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems. |
SAC |
1995 |
DBLP DOI BibTeX RDF |
Blink-trees, concurrent maintenance, periodic maintenance, performance analysis, database, deadlocks, B-trees, algorithm analysis |
23 | S. Rao Kosaraju |
Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
parameterized suffix trees, suffix tree algorithm, code duplication problem, computational complexity, pattern matching, trees (mathematics), string matching, suffix tree, algorithm theory |
23 | Majid Sarrafzadeh, C. K. Wong |
Bottleneck Steiner Trees in the Plane. |
IEEE Trans. Computers |
1992 |
DBLP DOI BibTeX RDF |
bottleneck Steiner trees, maximum-weight edge minimized, linear decision tree model, communication network design, computational complexity, lower bound, optimisation, NP-complete, trees (mathematics), VLSI layout, location problems |
23 | Krishna P. Belkhale, Prithviraj Banerjee |
Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach. |
IEEE Trans. Computers |
1992 |
DBLP DOI BibTeX RDF |
reconfiguration strategies, VLSI processor arrays, Diogenes approach, rectangular arrays, VLSI, fault tolerant computing, trees, trees (mathematics), circuit layout CAD, complete binary tree |
23 | Ajay K. Gupta 0001, Susanne E. Hambrusch |
Embedding Complete Binary Trees into Butterfly Networks. |
IEEE Trans. Computers |
1991 |
DBLP DOI BibTeX RDF |
wrap-around connections, multiprocessor interconnection networks, embeddings, trees (mathematics), complete binary trees, butterfly networks |
23 | O. J. Murphy, R. L. McCraw |
Designing Storage Efficient Decision Trees. |
IEEE Trans. Computers |
1991 |
DBLP DOI BibTeX RDF |
storage efficient decision trees, storage optimal decision tree, information-theoretic heuristic, computational complexity, computational complexity, data structures, trees (mathematics), decision theory, NP-complete problem, decision tables, decision tables |
23 | Philip A. Chou |
Optimal Partitioning for Classification and Regression Trees. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1991 |
DBLP DOI BibTeX RDF |
Kullback's information divergence, surrogate splits, composite nodes, speech recognition, speech recognition, partitioning, iterative methods, trees (mathematics), decision theory, clustering algorithm, iterative algorithm, text-to-speech, regression trees, decision graphs |
23 | Rüdiger Reischuk, Bernd Schmeltz |
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
noisy decision tree complexity, tree depth, noisy circuits, critical number, static Boolean decision trees, erroneous answers, noisy dynamic decision trees, lower bound, Boolean functions, computational model, Boolean circuits, questions, answers |
23 | Yigal Brandman, Alon Orlitsky, John L. Hennessy |
A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits. |
IEEE Trans. Computers |
1990 |
DBLP DOI BibTeX RDF |
spectral lower bound technique, two-level AND/OR circuits, arbitrary Boolean function, power spectrum coefficients, n dimensional Fourier transform, decision trees, Boolean functions, trees (mathematics), Fourier transforms, logic circuits |
23 | Cecilia R. Aragon, Raimund Seidel |
Randomized Search Trees |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
balancing strategy, tree balancing, dynamically changing search trees, optimal expected behavior, logarithmic time, update time, rotated subtree, weighted trees, expected time bounds |
23 | Guy Jacobson |
Space-efficient Static Trees and Graphs |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
static unlabeled trees, traversal operations, n-node trees, bits per node, bounded page number, data structure, data structures, planar graphs |
23 | N. Chandrasekharan, S. Sitharama Iyengar |
NC Algorithms for Recognizing Chordal Graphs and k Trees. |
IEEE Trans. Computers |
1988 |
DBLP DOI BibTeX RDF |
chordal graph recognition, parallel algorithms, parallel algorithms, graph theory, trees (mathematics), PRAM, k trees, NC algorithms |
23 | Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong |
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. |
IEEE Trans. Computers |
1987 |
DBLP DOI BibTeX RDF |
rectilinear metric, Computational geometry, shortest paths, minimum spanning trees, Steiner trees, obstacles |
23 | M. Douglas McIlroy |
Algorithm 354: generator of spanning trees [H]. |
Commun. ACM |
1969 |
DBLP DOI BibTeX RDF |
graphs, trees, spanning trees |
23 | Venkata Snehith Cherukuri, K. Selçuk Candan |
Propagation-vectors for trees (PVT): concise yet effective summaries for hierarchical data and trees. |
LSDS-IR |
2008 |
DBLP DOI BibTeX RDF |
tree summarization, p2p search |
23 | Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob |
Cache oblivious search trees via binary trees of small height. |
SODA |
2002 |
DBLP BibTeX RDF |
|
23 | Laurent Mauborgne |
Improving the Representation of Infinite Trees to Deal with Sets of Trees. |
ESOP |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Tiziana Calamoneri, Miriam Di Ianni |
Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. |
Euro-Par |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Stephen J. Willson |
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data. |
IEEE ACM Trans. Comput. Biol. Bioinform. |
2009 |
DBLP DOI BibTeX RDF |
Trees, Graph algorithms, phylogenetic tree, supertree |
22 | Amir Ahmad, Gavin Brown 0001 |
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data. |
MCS |
2009 |
DBLP DOI BibTeX RDF |
Random Ordinality, Binary splits, Multi-way splits, Decision trees, Data fragmentation |
22 | Anna Kasprzik |
Two Equivalent Regularizations for Tree Adjoining Grammars. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
Tree Adjoining Grammar, Multi-Dimensional Trees, Regularization, Lifting |
22 | Simon Bernard 0001, Laurent Heutte, Sébastien Adam |
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation. |
ICIC (2) |
2009 |
DBLP DOI BibTeX RDF |
Classifier Selection, Classification, Decision Trees, Ensemble Method, Random Forests, Ensemble of Classifiers |
22 | André Berger, Ojas Parekh |
Linear Time Algorithms for Generalized Edge Dominating Set Problems. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Trees, Edge dominating set |
22 | Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan |
Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach. |
VLDB J. |
2008 |
DBLP DOI BibTeX RDF |
Streaming data dissemination, Dissemination trees, Distributed stream processing |
22 | Seung-Jin Sul, Grant R. Brammer, Tiffani L. Williams |
Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices. |
WABI |
2008 |
DBLP DOI BibTeX RDF |
Robinson-Foulds distance, clustering, performance analysis, phylogenetic trees |
22 | Xuegang Hu, Pei-Pei Li 0001, Xindong Wu 0001, Gong-Qing Wu |
A Semi-Random Multiple Decision-Tree Algorithm for Mining Data Streams. |
J. Comput. Sci. Technol. |
2007 |
DBLP DOI BibTeX RDF |
Naïve Bayes, data streams, random decision trees |
22 | Sheela Ramanna, Rajen Bhatt, Piotr Biernot |
A Rough-Hybrid Approach to Software Defect Classification. |
RSFDGrC |
2007 |
DBLP DOI BibTeX RDF |
Neuro-Fuzzy-Decision Trees, Classification, Rough Sets, Software Defects |
22 | Hassan Artail |
HIL-Tree: A Hierarchical Structure for Guiding Search into Test and Measurement Data Archives. |
Data Min. Knowl. Discov. |
2005 |
DBLP DOI BibTeX RDF |
index trees, multilevel queries, discontinuity detection, data segmentation |
22 | Foster J. Provost, Pedro M. Domingos |
Tree Induction for Probability-Based Ranking. |
Mach. Learn. |
2003 |
DBLP DOI BibTeX RDF |
Laplace correction, classification, decision trees, ranking, bagging, cost-sensitive learning, probability estimation |
22 | Sajama, Zygmunt J. Haas |
Independent-Tree Ad hoc MulticAst Routing (ITAMAR). |
Mob. Networks Appl. |
2003 |
DBLP DOI BibTeX RDF |
independent trees, route stability, ad hoc networks, multicasting, multicasting tree |
22 | Rita P. Ribeiro, Luís Torgo |
Predicting Harmful Algae Blooms. |
EPIA |
2003 |
DBLP DOI BibTeX RDF |
prediction, Outliers, rare events, regression trees |
22 | Paolo Frasconi, Marco Gori, Giovanni Soda |
Data Categorization Using Decision Trellises. |
IEEE Trans. Knowl. Data Eng. |
1999 |
DBLP DOI BibTeX RDF |
context specific independence, data mining, machine learning, classification, decision trees, Belief networks, connectionist models |
22 | Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Matching Hierarchical Structures Using Association Graphs. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1999 |
DBLP DOI BibTeX RDF |
Maximal subtree isomorphisms, replicator dynamical systems, shock trees, shape recognition, maximal cliques, association graphs |
22 | Tin Kam Ho |
Random decision forests. |
ICDAR |
1995 |
DBLP DOI BibTeX RDF |
random decision forests, generalization accuracy, suboptimal accuracy, tree-based classifiers, complexity, decision trees, optical character recognition, handwriting recognition, stochastic modeling, decision theory, handwritten digits |
21 | Feng Pan 0012, Tim Converse, David Ahn, Franco Salvetti, Gianluca Donato |
Feature selection for ranking using boosted trees. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
boosted trees, information retrieval, feature selection |
Displaying result #401 - #500 of 28571 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|