|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 21770 occurrences of 6923 keywords
|
|
|
|
|
Results
Found 26872 publication records. Showing 26872 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 7 | Sanghyun Ahn, David Hung-Chang Du |
A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications. (PDF / PS)  |
LCN  |
1996 |
DBLP DOI BibTeX RDF |
multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic |
| 7 | Akhil Kumar |
G-Tree: A New Data Structure for Organizing Multidimensional Data.  |
IEEE Trans. Knowl. Data Eng.  |
1994 |
DBLP DOI BibTeX RDF |
G-tree, multidimensional data organisation, grid tree, ordering property, multidimensional space, partition numbers, dynamic data spaces, nonuniform data distributions, deletion operations, BD tree, zkdb tree, KDB tree, simulated bucket utilization rates, data structure, trees (mathematics), range queries, B-trees, tree data structures, data handling |
| 6 | Friedrich Otto, Heiko Stamer |
Single-Path Restarting Tree Automata.  |
CAI  |
2009 |
DBLP DOI BibTeX RDF |
restarting tree automaton, single-path top-down tree automaton, classes of tree languages, linear context-free tree language |
| 6 | Norbert Beckmann, Bernhard Seeger |
A revised r*-tree in comparison with related index structures.  |
SIGMOD Conference  |
2009 |
DBLP DOI BibTeX RDF |
choosesubtree, hilbert-r-tree, revised r*-tree, rr*-tree, r-tree, performance comparison, index structures, split, multi-dimensional data |
| 6 | Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen |
Efficient generation of short and fast repeater tree topologies.  |
ISPD  |
2006 |
DBLP DOI BibTeX RDF |
inverter tree, repeater tree, buffering, tree topology, rectilinear Steiner tree |
| 6 | Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang |
An Improved Algorithm for the Maximum Agreement Subtree Problem.  |
BIBE  |
2004 |
DBLP DOI BibTeX RDF |
maximum agreement sub-tree, leaf-labelled tree, k-dimensional range search tree, k-dimensional binary search tree, Evolutionary tree |
| 6 | Richard J. Anderson |
Tree Data Structures for N-Body Simulation.  |
FOCS  |
1996 |
DBLP DOI BibTeX RDF |
spatial decomposition tree, particle-cluster force evaluation algorithms, Barnes-Hut algorithm, spatially balanced tree, force evaluation, tree data structures, tree data structures, k-d tree, worst case complexity, N-body simulation |
| 6 | Subhada K. Mishra, Vijay V. Raghavan, Nian-Feng Tzeng |
Efficient Algorithms For Selection of Recovery Points in Tree Task Models.  |
IEEE Trans. Software Eng.  |
1991 |
DBLP DOI BibTeX RDF |
tree task models, recovery points, task precedence, uniprocessor environment, binary tree model, exponential time requirements, arbitrary tree model, computational complexity, optimisation, time complexity, trees (mathematics), tree structure |
| 5 | Yi-Hua E. Yang, Viktor K. Prasanna |
High throughput and large capacity pipelined dynamic search tree on FPGA.  |
FPGA  |
2010 |
DBLP DOI BibTeX RDF |
2-3 tree, in-place update, ip forwarding, pipelined tree, b-tree, dynamic update, incremental update, openflow |
| 5 | Christopher M. De Vries, Shlomo Geva |
K-tree: large scale document clustering.  |
SIGIR  |
2009 |
DBLP DOI BibTeX RDF |
K-means, document clustering, B-tree, search tree, K-tree |
| 5 | Amany Abdelhalim, Issa Traoré, Bassam Sayed |
RBDT-1: A New Rule-Based Decision Tree Generation Technique.  |
RuleML  |
2009 |
DBLP DOI BibTeX RDF |
attribute selection criteria, data-based decision tree, rule-based decision tree, tree complexity, decision rules |
| 5 | Chih-Yung Chang, Yu-Chieh Chen, Sheng-Wen Chang, Shih-Chun Kuo |
On supporting obstacle-free and sharing tree for information collection in WSNs.  |
Mobility Conference  |
2008 |
DBLP DOI BibTeX RDF |
obstacle-free routing, steiner tree, multicast tree, share tree |
| 5 | Alexander Zelitchenko |
About Vi-Fi ("Visible - Findable") - how to describe and to search sites with standard and universal semantic-pragmatic tree: semantic web as pragmatic web.  |
ICPW  |
2008 |
DBLP DOI BibTeX RDF |
semantic tree, standard tree, universal tree, ontology, semantic web, web search, pragmatic web |
| 5 | Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang |
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.  |
COCOA  |
2008 |
DBLP DOI BibTeX RDF |
Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree |
| 5 | Chandra Prakash |
B-tree with fixed node size and no minimum degree.  |
Journal in Computer Virology  |
2007 |
DBLP DOI BibTeX RDF |
Byte, Prefix B-tree, String B-tree, B+-tree |
| 5 | Marina Meila, Tommi Jaakkola |
Tractable Bayesian learning of tree belief networks.  |
Statistics and Computing  |
2006 |
DBLP DOI BibTeX RDF |
Tree belief network, Decomposable prior, Matrix tree theorem, Spanning tree, Graphical model, Bayesian |
| 5 | Prabha Sharma |
Algorithms for the optimum communication spanning tree problem.  |
Annals OR  |
2006 |
DBLP DOI BibTeX RDF |
Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution |
| 5 | Linzhong Liu, Ruichun He, Yinzhen Li |
The Fuzzy Weighted k-Cardinality Tree and Its Hybrid Genetic Algorithm.  |
FSKD  |
2006 |
DBLP DOI BibTeX RDF |
credibility measure, quadratic tree, genetic algorithm, Fuzzy set, spanning tree, k-tree |
| 5 | Guohui Lin |
An Improved Approximation Algorithm for Multicast k-Tree Routing.  |
J. Comb. Optim.  |
2005 |
DBLP DOI BibTeX RDF |
multicast k-tree routing, weight averaging, approximation algorithm, tree partitioning, Steiner minimum tree |
| 5 | Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli |
k-Restricted Rotation with an Application to Search Tree Rebalancing.  |
WADS  |
2005 |
DBLP DOI BibTeX RDF |
Rotation distance, Rebalancing, Data structures, Rotation, Binary tree, Search tree, AVL tree, Design of algorithms |
| 5 | Bin Cui, Beng Chin Ooi, Jianwen Su, Kian-Lee Tan |
Main Memory Indexing: The Case for BD-Tree.  |
IEEE Trans. Knowl. Data Eng.  |
2004 |
DBLP DOI BibTeX RDF |
BD-tree, {rm{B}}^+{hbox{-}}{rm{tree}}, {rm{CSB}}^+{hbox{-}}{rm{tree}}, Main memory databases |
| 5 | Ben Pfaff |
Performance analysis of BSTs in system software.  |
SIGMETRICS  |
2004 |
DBLP DOI BibTeX RDF |
threaded tree, binary search tree, AVL tree, red-black tree, BST, splay tree |
| 5 | Yun Chi, Yirong Yang, Richard R. Muntz |
HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Form.  |
SSDBM  |
2004 |
DBLP DOI BibTeX RDF |
tree iso-morphism, enumeration tree, rooted unordered tree, free tree, canonical form, frequent subtree |
| 5 | Ernst Kleiberg, Huub van de Wetering, Jarke J. van Wijk |
Botanical Visualization of Huge Hierarchies.  |
INFOVIS  |
2001 |
DBLP DOI BibTeX RDF |
botanical tree, logical tree, huge hierarchy, directory tree, phyllotaxis, tree visualization, strands |
| 5 | Carsten Kleiner, Udo W. Lipeck |
Efficient Index Structures for Spatio-Temporal Objects. (PDF / PS)  |
DEXA Workshops  |
2000 |
DBLP DOI BibTeX RDF |
spatio-temporal objects, tree-based access structures, spatio-temporal queries, generalized search trees, SS-tree, size-based penalty metrics, distance-based penalty metrics, tree data structures, index structures, spatial queries, temporal queries, R*-tree, database indexing |
| 5 | Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shimodaira |
A visualization tool for interactive learning of large decision trees.  |
ICTAI  |
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 |
| 5 | Greg N. Frederickson |
Maintaining Regular Properties Dynamically in k-Terminal Graphs.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
Dynamic graph operation, k -Terminal graph, Tree-decomposable graph, t -Topology tree. Key words, Dynamic graph operation, k -Terminal graph, Tree-decomposable graph, t -Topology tree, Data structures, Data structures, Analysis of algorithms, Analysis of algorithms |
| 5 | Taghi M. Khoshgoftaar, Edward B. Allen, Lofton A. Bullard, Robert Halstead, Gary P. Trio |
A tree-based classification model for analysis of a military software system. (PDF / PS)  |
HASE  |
1996 |
DBLP DOI BibTeX RDF |
tree based classification model, military software systems analysis, tactical military software, software function, military personnel, tree based modeling method, fault prone software modules, Joint Surveillance Target Attack Radar System, JSTPARS, large tactical military system, decision tree model, software product metrics, spiral life cycle, highly reliable final product, fault prone class, TREED-ISC algorithm, CHAID algorithm, independent variables, statistically significant relationships, military computing, fault prone modules, chi squared tests, mission critical |
| 5 | Abdel Ejnioui, N. Ranganathan |
Systolic algorithms for tree pattern matching. (PDF / PS)  |
ICCD  |
1995 |
DBLP DOI BibTeX RDF |
pattern tree, subject tree, PRAM model of computation, linear systolic array model, parallel algorithms, parallel algorithms, pattern matching, systolic arrays, SIMD machine, systolic algorithms, tree pattern matching |
| 5 | Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal |
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms.  |
IEEE Trans. Parallel Distrib. Syst.  |
1994 |
DBLP DOI BibTeX RDF |
token-based distributed mutualexclusion algorithms, tree-based distributed mutual exclusion algorithms, permission-based mutual exclusion algorithms, rooted tree structure, informationstructure, topology requirements, distributed algorithms, distributed algorithms, topology, tree data structures, generic algorithm |
| 5 | George Karypis, Vipin Kumar |
Unstructured Tree Search on SIMD Parallel Computers.  |
IEEE Trans. Parallel Distrib. Syst.  |
1994 |
DBLP DOI BibTeX RDF |
unstructured tree search, SIMD parallelcomputers, unstructured tree computations, large-scale SIMD machines, triggering mechanism, search spaceredistribution, load-balancing methods, load-balancing schemes, 15-puzzle problem, CM-2 SIMD parallel computer, performance evaluation, scalability, load balancing, resource allocation, parallel machines, trees (mathematics), search problems, tree search, SIMD machine, MIMD architectures, parallelarchitectures |
| 5 | Arnold L. Rosenberg, Lawrence Snyder |
Time- and Space-Optimality in B-Trees.  |
ACM Trans. Database Syst.  |
1981 |
DBLP DOI BibTeX RDF |
2, 3-tree, bushy B-tree, compact B-tree, node-visit cost, B-tree, space utilization |
| 4 | Dirk Thierens |
Linkage tree genetic algorithm: first results.  |
GECCO (Companion)  |
2010 |
DBLP DOI BibTeX RDF |
linkage tree, linkage tree genetic algorithm, ltga, variation of information, genetic algorithms, mutual information, hierarchical clustering, linkage learning |
| 4 | Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno |
Higher-order multi-parameter tree transducers and recursion schemes for program verification.  |
POPL  |
2010 |
DBLP DOI BibTeX RDF |
higher-order tree transducers, tree-processing programs, program verification, higher-order recursion scheme |
| 4 | Diego Figueira |
Forward-XPath and extended register automata on data-trees.  |
ICDT  |
2010 |
DBLP DOI BibTeX RDF |
alternating tree register automata, data-tree, forward XPath, infinite alphabet, unranked ordered tree, XML |
| 4 | Muhaimenul Adnan, Reda Alhajj |
DRFP-tree: disk-resident frequent pattern tree.  |
Appl. Intell.  |
2009 |
DBLP DOI BibTeX RDF |
DRFP-growth, DRFP-tree, Data mining, Association rules, Frequent pattern, FP-tree, FP-growth |
| 4 | Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada |
Incremental Construction of Minimal Tree Automata.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Deterministic tree automata, Incremental construction of minimal tree automata |
| 4 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Labeling Schemes for Tree Representation.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Spanning tree, Labeling scheme, Tree representation |
| 4 | Dimitri Theodoratos, Pawel Placek, Theodore Dalamagas, Stefanos Souldatos, Timos K. Sellis |
Containment of partially specified tree-pattern queries in the presence of dimension graphs.  |
VLDB J.  |
2009 |
DBLP DOI BibTeX RDF |
Partial tree-pattern query, XML, Query containment, Tree-structured data |
| 4 | Zoltán Fülöp, Andreas Maletti, Heiko Vogler |
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Recognizable tree series, Rational tree series, Multioperator monoids, Semirings |
| 4 | Andreas Maletti, Catalin Ionut Tîrnauca |
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited.  |
CAI  |
2009 |
DBLP DOI BibTeX RDF |
tree bimorphism, natural language processing, syntax-directed translation, regular tree language |
| 4 | Ding Lin, Chongcheng Chen, Liyu Tang, Qinmin Wang |
Geometrical shapes and swaying movements of realistic tree: design and implementation.  |
VRCAI  |
2009 |
DBLP DOI BibTeX RDF |
interactive tree modeling, tree swaying, animation, physical based modeling |
| 4 | Inna Vaisband, Ran Ginosar, Avinoam Kolodny, Eby G. Friedman |
Power efficient tree-based crosslinks for skew reduction.  |
ACM Great Lakes Symposium on VLSI  |
2009 |
DBLP DOI BibTeX RDF |
crosslink, non-tree clock distribution network, power, mesh, skew, clock tree |
| 4 | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi |
Minmax Tree Cover in the Euclidean Space.  |
WALCOM  |
2009 |
DBLP DOI BibTeX RDF |
Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms |
| 4 | Chih-Hung Liu, Shih-Yi Yuan, Sy-Yen Kuo, Yao-Hsin Chou |
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction.  |
DAC  |
2009 |
DBLP DOI BibTeX RDF |
routing, spanning tree, physical design, Steiner tree |
| 4 | Zhipeng Cai, Randy Goebel, Guohui Lin |
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem.  |
COCOA  |
2009 |
DBLP DOI BibTeX RDF |
Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning |
| 4 | Fanica Gavril, Alon Itai |
Covering a Tree by a Forest.  |
Graph Theory, Computational Intelligence and Thought  |
2009 |
DBLP DOI BibTeX RDF |
vertex-cover of a tree by a forest, edge-cover of a tree by a forest, graph algorithms |
| 4 | Nicolas Beldiceanu, Pierre Flener, Xavier Lorca |
Combining Tree Partitioning, Precedence, and Incomparability Constraints.  |
Constraints  |
2008 |
DBLP DOI BibTeX RDF |
Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem |
| 4 | Henry Tan, Fedja Hadzic, Tharam S. Dillon, Elizabeth Chang, Ling Feng |
Tree model guided candidate generation for mining frequent subtrees from XML documents.  |
TKDD  |
2008 |
DBLP DOI BibTeX RDF |
FREQT, TMG, TreeMiner, tree model guided, Tree mining |
| 4 | Jieyi Long, Hai Zhou, Seda Ogrenci Memik |
An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction.  |
ISPD  |
2008 |
DBLP DOI BibTeX RDF |
minimum terminal spanning tree, spanning graph, routing, physical design, steiner tree |
| 4 | Chih-Hung Liu, Yao-Hsin Chou, Shih-Yi Yuan, Sy-Yen Kuo |
Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree.  |
ISPD  |
2008 |
DBLP DOI BibTeX RDF |
routing, spanning tree, physical design, steiner tree |
| 4 | Minsoo Lee, Hyejung Yoon, Yearn Jeong Kim, Yoon-kyung Lee |
SMILE tree: a stream data multi-query indexing technique with level-dimension nodes and extended-range nodes.  |
ICUIMC  |
2008 |
DBLP DOI BibTeX RDF |
R+-tree, spatial indexing techniques, sensor network, stream data, k-d tree |
| 4 | Christopher M. De Vries, Shlomo Geva |
Document Clustering with K-tree.  |
INEX  |
2008 |
DBLP DOI BibTeX RDF |
XML Mining, Clustering, Support Vector Machine, Tree, Text Classification, Vector Quantization, INEX, K-tree |
| 4 | Hiroki Matsutani, Michihiro Koibuchi, D. Frank Hsu, Hideharu Amano |
Three-Dimensional Layout of On-Chip Tree-Based Networks.  |
ISPAN  |
2008 |
DBLP DOI BibTeX RDF |
Fat H-Tree, Network-on-Chip, Fat Tree, 3-D IC |
| 4 | Sun-Yuan Hsieh, Wen-Hao Pi |
On the Partial-Terminal Steiner Tree Problem.  |
ISPAN  |
2008 |
DBLP DOI BibTeX RDF |
The Steiner tree problem, the partial-terminal Steiner tree problem, approximation algorithms, MAX SNP-hardness |
| 4 | Wissam Khalil |
More expressive extensions of TQL.  |
CSTST  |
2008 |
DBLP DOI BibTeX RDF |
constraints on unbound-arity trees, context-free tree languages, synchronized context-free tree languages, synchronized regular tree languages, the TQL logic |
| 4 | Mohamed Amine Boutiche |
Control of Some Graph Invariants in Dynamic Routing.  |
MCO  |
2008 |
DBLP DOI BibTeX RDF |
Tree length, Routing, Graphs, Topology Control, Tree Decomposition, Tree width |
| 4 | Bernhard Fuchs, Walter Kern, Xinhui Wang |
The Number of Tree Stars Is O *(1.357 k ).  |
Algorithmica  |
2007 |
DBLP DOI BibTeX RDF |
Terminal points, Tree star, Rectilinear Steiner tree |
| 4 | Sun-Yuan Hsieh, Huang-Ming Gao |
On the partial terminal Steiner tree problem.  |
The Journal of Supercomputing  |
2007 |
DBLP DOI BibTeX RDF |
The Steiner tree problem, The partial terminal Steiner tree problem, Approximation algorithms, NP-complete, MAX SNP-hard |
| 4 | Frank Gurski, Egon Wanke |
The Clique-Width of Tree-Power and Leaf-Power Graphs.  |
WG  |
2007 |
DBLP DOI BibTeX RDF |
tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers |
| 4 | Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro |
Distributed Computation of All Node Replacements of a Minimum Spanning Tree.  |
Euro-Par  |
2007 |
DBLP DOI BibTeX RDF |
Replacement Tree, Distributed Algorithms, Minimum Spanning Tree, Node Failure |
| 4 | Hong-Koo Kang, Joung-Joon Kim, Dong-Oh Kim, Ki-Joon Han |
An Extended R-Tree Indexing Method Using Selective Prefetching in Main Memory.  |
International Conference on Computational Science  |
2007 |
DBLP DOI BibTeX RDF |
SPR-Tree, Extended R-Tree, Cache Performance, Cache Miss, Main Memory |
| 4 | Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen Chang, Chia-Lin Yang |
Efficient obstacle-avoiding rectilinear steiner tree construction.  |
ISPD  |
2007 |
DBLP DOI BibTeX RDF |
routing, spanning tree, physical design, Steiner tree |
| 4 | Róbert Busa-Fekete, András Kocsor, Csaba Bagyinka |
A Multi-Stack Based Phylogenetic Tree Building Method.  |
ISBRA  |
2007 |
DBLP DOI BibTeX RDF |
tree estimation, Multi-Stack, tree-joining operator, Phylogenetics |
| 4 | Magnus Steinby, Catalin Ionut Tîrnauca |
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.  |
CIAA  |
2007 |
DBLP DOI BibTeX RDF |
tree bimorphisms, natural language processing, syntax-directed translations, regular tree languages |
| 4 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
| 4 | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |
Cache-oblivious streaming B-trees.  |
SPAA  |
2007 |
DBLP DOI BibTeX RDF |
buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree |
| 4 | Prahlad Fogla, Wenke Lee |
q-Gram Matching Using Tree Models.  |
IEEE Trans. Knowl. Data Eng.  |
2006 |
DBLP DOI BibTeX RDF |
q{hbox{-}}{rm gram} matching, Intrusion detection, pattern matching, trees, string matching, search problems, suffix tree, tree data structure, word processing |
| 4 | Guangting Chen, Gu Zhang, Rainer E. Burkard |
The web proxy location problem in general tree of rings networks.  |
J. Comb. Optim.  |
2006 |
DBLP DOI BibTeX RDF |
General tree of rings, Tree, Placement, Proxy, Location problem |
| 4 | J.-R. Chang, K.-H. Chang, S.-H. Liao, C.-H. Cheng |
The reliability of general vague fault-tree analysis on weapon systems fault diagnosis.  |
Soft Comput.  |
2006 |
DBLP DOI BibTeX RDF |
Vague fault tree analysis, Vague fault tree decision support systems (VFTDSS), Reliability analysis, Military application, Vague sets |
| 4 | Minghe Sun |
A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization.  |
Annals OR  |
2006 |
DBLP DOI BibTeX RDF |
Primogenitary linked quad tree, Multiple criteria optimization, Data structures, Multiple criteria decision making, Quad tree |
| 4 | Katerina Asdre, Stavros D. Nikolopoulos |
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations.  |
J. Comput. Sci. Technol.  |
2006 |
DBLP DOI BibTeX RDF |
event set algorithms, hold model, event horizon, P-tree structures, data structures, discrete-event simulation, heap, P-tree |
| 4 | William A. Greene |
A tree-based genetic algorithm for building rectilinear Steiner arborescences.  |
GECCO  |
2006 |
DBLP DOI BibTeX RDF |
rectilinear Steiner arborescences, tree-based geneticism, tree-structured chromosomes, genetic algorithms |
| 4 | Won-Sik Kim, Woong-Kee Loh, Wook-Shin Han |
Performance Analysis of the Cache Conscious-Generalized Search Tree.  |
International Conference on Computational Science  |
2006 |
DBLP DOI BibTeX RDF |
cache conscious tree, generalized search tree, pointer compression, key compression |
| 4 | Kun-Ming Yu, Jiayi Zhou, Chun-Yuan Lin, Chuan Yi Tang |
An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR.  |
ISPA Workshops  |
2006 |
DBLP DOI BibTeX RDF |
minimum ultrametric tree, parallel branch-and-bound algorithm, 3-point relationship, 4-point relationship, phylogenetic tree |
| 4 | Jia-Jun Wong, Siu-Yeung Cho |
Facial emotion recognition by adaptive processing of tree structures.  |
SAC  |
2006 |
DBLP DOI BibTeX RDF |
facial emotion tree structures, probabilistic based neural networks, neural networks, tree structures |
| 4 | Xiaoqiu Tan, Min Yao, Jianke Zhang |
Mining Maximal Frequent Access Sequences Based on Improved WAP-tree.  |
ISDA  |
2006 |
DBLP DOI BibTeX RDF |
Web Access pattern tree, Restrained sub-tree, Maximum Access Sequence, Web Usage Mining, Sequential pattern mining |
| 4 | Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi |
Towards automatic parallelization of tree reductions in dynamic programming.  |
SPAA  |
2006 |
DBLP DOI BibTeX RDF |
commutative semiring, parallel tree contraction, parallel programming, dynamic programming, code generator, tree |
| 4 | Amaury Habrard, José Oncina |
Learning Multiplicity Tree Automata.  |
ICGI  |
2006 |
DBLP DOI BibTeX RDF |
multiplicity tree automata, recognizable tree series, learning from equivalence and membership queries |
| 4 | Dimitri Theodoratos, Stefanos Souldatos, Theodore Dalamagas, Pawel Placek, Timos K. Sellis |
Heuristic containment check of partial tree-pattern queries in the presence of index graphs.  |
CIKM  |
2006 |
DBLP DOI BibTeX RDF |
partial tree-pattern query, query containment, tree-structured data |
| 4 | Joe Sawada |
Generating rooted and free plane trees.  |
ACM Transactions on Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
CAT algorithm, chord diagram, free plane tree, necklace, planar tree, rooted plane tree |
| 4 | Haibin Lu |
A Novel High-Order Tree for Secure Multicast Key Management.  |
IEEE Trans. Computers  |
2005 |
DBLP DOI BibTeX RDF |
high-order tree, Group key management, secure multicast, rekeying, dynamic group, balanced tree |
| 4 | W. Melody Moh, Marie Dumont, Teng-Sheng Moh, Takeo Hamada, Ching-Fong Su |
Brief announcement: evaluation of tree-based data gathering algorithms for wireless sensor networks.  |
PODC  |
2005 |
DBLP DOI BibTeX RDF |
maximum-leaf tree algorithm, shortest-path tree algorithm, routing, energy efficiency |
| 4 | Dimitri Theodoratos, Theodore Dalamagas, Antonis Koufopoulos, Narain H. Gehani |
Semantic querying of tree-structured data sources using partially specified tree patterns.  |
CIKM  |
2005 |
DBLP DOI BibTeX RDF |
query satisfiability, tree-pattern queries, XML, query evaluation, tree-structured data |
| 4 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul |
Concurrent cache-oblivious b-trees.  |
SPAA  |
2005 |
DBLP DOI BibTeX RDF |
cache-oblivious b-tree, concurrent b-tree, exponential tree, packed-memory array, lock free, non-blocking |
| 4 | Yun Chi, Yirong Yang, Richard R. Muntz |
Canonical forms for labelled trees and their applications in frequent subtree mining.  |
Knowl. Inf. Syst.  |
2005 |
DBLP DOI BibTeX RDF |
Labelled free tree, Labelled rooted unordered tree, Tree isomorphism, Canonical form, Frequent subtree |
| 4 | Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee |
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction.  |
J. Comb. Optim.  |
2004 |
DBLP DOI BibTeX RDF |
multiple sequence alignment, evolutionary tree, minimal spanning tree |
| 4 | Hélène Fargier, Marie-Catherine Vilarem |
Compiling CSPs into Tree-Driven Automata for Interactive Solving.  |
Constraints  |
2004 |
DBLP DOI BibTeX RDF |
interactive constraint solving, CSP compilation, tree clustering, configuration, tree automata |
| 4 | Tetsuo Shibuya |
Generalization of a Suffix Tree for RNA Structural Pattern Matching.  |
Algorithmica  |
2004 |
DBLP DOI BibTeX RDF |
Suffix tree generalization, Parameterized suffix tree, RNA structure matching, Pattern matching, Computational biology |
| 4 | Yon Dourisboure |
Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs.  |
DISC  |
2004 |
DBLP DOI BibTeX RDF |
tree-length, chordality, compact routing, tree-decomposition |
| 4 | Michael Szydlo |
Merkle Tree Traversal in Log Space and Time.  |
EUROCRYPT  |
2004 |
DBLP DOI BibTeX RDF |
authentication path, tail zipping, fractal traversal, binary tree, pebbling, Merkle tree, amortization |
| 4 | Michal Krátký, Jaroslav Pokorný, Václav Snásel |
Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data.  |
EDBT Workshops  |
2004 |
DBLP DOI BibTeX RDF |
indexing XML data, XPath axes, multi-dimensional data structures, BUB-forest, Signature R*-tree, R*-tree, UB-tree |
| 4 | Tamara Munzner, François Guimbretière, Serdar Tasiran, Li Zhang 0001, Yunhong Zhou |
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility.  |
ACM Trans. Graph.  |
2003 |
DBLP DOI BibTeX RDF |
tree drawing, information visualization, Focus+Context, phylogenetic tree, realtime rendering |
| 4 | Bruce A. Reed |
The height of a random binary search tree.  |
J. ACM  |
2003 |
DBLP DOI BibTeX RDF |
random tree, second moment method, probabilistic analysis, Binary search tree, asymptotics, height |
| 4 | Hai Zhou |
Efficient Steiner tree construction based on spanning graphs.  |
ISPD  |
2003 |
DBLP DOI BibTeX RDF |
routing, Steiner tree, minimal spanning tree |
| 4 | John Bluis, Dong-Guk Shin |
Nodal Distance Algorithm: Calculating a Phylogenetic Tree Comparison Metri. (PDF / PS)  |
BIBE  |
2003 |
DBLP DOI BibTeX RDF |
algorithm, phylogenetic tree, tree comparison |
| 4 | Gabriel Valiente |
Constrained Tree Inclusion.  |
CPM  |
2003 |
DBLP DOI BibTeX RDF |
Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching |
| 4 | Hongyu Chen, Changge Qiao, Feng Zhou, Chung-Kuan Cheng |
Refined single trunk tree: a rectilinear steiner tree generator for interconnect prediction.  |
SLIP  |
2002 |
DBLP DOI BibTeX RDF |
rectilinear steiner tree algorithm, refined single trunk tree, routing estimation, VLSI CAD |
| 4 | S. C. Samuel, D. G. Thomas, P. J. Abisha, K. G. Subramanian |
Tree Replacement and Public Key Cryptosystem.  |
INDOCRYPT  |
2002 |
DBLP DOI BibTeX RDF |
tree replacement system, Church-Rosser tree replacement system, public key cryptosystem (PKC), word problem |
| 4 | Mely Chen Chi, Shih-Hsu Huang |
A Reliable Clock Tree Design Methodology for ASIC Designs.  |
ISQED  |
2000 |
DBLP DOI BibTeX RDF |
Clock tree design, Clock tree synthesis |
Displaying result #1 - #100 of 26872 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|