|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 488 occurrences of 367 keywords
|
|
|
Results
Found 768 publication records. Showing 768 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
125 | Lei Zou 0001, Yansheng Lu, Huaming Zhang, Rong Hu |
Mining Frequent Induced Subtree Patterns with Subtree-Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 3-7, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
117 | James W. George, Charles S. Revelle, John R. Current |
The Maximum Utilization Subtree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 110(1-4), pp. 133-151, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
117 | Bhaskar DasGupta, Xin He, Tao Jiang 0001, Ming Li 0001, John Tromp |
On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 25(2-3), pp. 176-195, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Lower bounds, Evolutionary trees |
87 | Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz |
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 8th Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, May 26-28, 2004, Proceedings, pp. 63-73, 2004, Springer, 3-540-22064-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
closed subtree, maximal subtree, enumeration tree, rooted unordered tree, Frequent subtree |
80 | Justin C. Williams |
Optimal Direct and Indirect Covering Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 123(1-4), pp. 265-284, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
covering tree, extensive facility, location, transportation network |
77 | Michael Benedikt, Irini Fundulaki |
XML Subtree Queries: Specification and Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages, 10th International Symposium, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers, pp. 138-153, 2005, Springer, 3-540-30951-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
77 | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson |
Approximate Labelled Subtree Homeomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 59-73, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
77 | James W. George, Charles S. Revelle |
Bi-Objective Median Subtree Location Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 122(1-4), pp. 219-232, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
extensive facility location, structure location, tree, network design, median, multiobjective |
67 | Sun-Yuan Hsieh, Ting-Yu Chou |
Finding a Weight-Constrained Maximum-Density Subtree in a Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 944-953, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
66 | Oana Muntean, Laura Diosan, Mihai Oltean |
Best SubTree genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 1667-1673, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
classification, genetic programming, regression, subtree |
66 | Jing Wang 0066, Ying Li, Xinmei Wang |
An Algorithm to Search Minimal Subtree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 2007 International Conference on Parallel Processing Workshops (ICPP Workshops 2007), 10-14 September 2007, Xi-An, China, pp. 39, 2007, IEEE Computer Society, 978-0-7695-2934-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multicast routing graph, minimal subtree graph, information flow, network coding |
66 | Ron Shamir, Dekel Tsur |
Faster subtree isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 126-131, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem |
66 | Partha Biswas, Girish Venkataramani |
Comprehensive isomorphic subtree enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2008 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2008, Atlanta, GA, USA, October 19-24, 2008, pp. 177-186, 2008, ACM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
subtree isomorphism, subtree matching algorithm, embedded systems |
65 | Josiah Carlson, David Eppstein |
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. ![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. 400-410, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
58 | Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas |
Linear time 3-approximation for the MAST problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 23:1-23:18, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree |
57 | Yun Chi, Yi Xia, Yirong Yang, Richard R. Muntz |
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(2), pp. 190-202, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
closed frequent subtree, maximal frequent subtree, data mining, Trees, graph algorithms, mining methods and algorithms, frequent subtree |
57 | Josephine Micallef, Gail E. Kaiser |
Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 19(3), pp. 231-252, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
incremental attribute evaluation, multiple asynchronous subtree replacements, arbitrary noncircular attribute grammars, multiple independent editing cursors, disjoint regions, derivation tree, computational complexity, complexity, trees (mathematics), attribute grammars, tree data structures, text editing, open problems |
56 | Tomás Flouri, Borivoj Melichar, Jan Janousek |
Aho-Corasick like multiple subtree matching by pushdown automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 2157-2158, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
subtree matching, pattern matching, tree, pushdown automata, subtree |
56 | Dmitry Keselman, Amihood Amir |
Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 758-769, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
maximum agreement subtree, homeomorphic agreement subtree, approximation algorithm, metrics, efficient algorithms, evolutionary trees |
50 | Lei Zou 0001, Yansheng Lu, Huaming Zhang, Rong Hu |
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISE ![In: Web Information Systems - WISE 2006, 7th International Conference on Web Information Systems Engineering, Wuhan, China, October 23-26, 2006, Proceedings, pp. 499-505, 2006, Springer, 3-540-48105-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Justo Puerto, Arie Tamir |
Locating tree-shaped facilities using the ordered median objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 102(2), pp. 313-338, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Chun-Cheng Lin, Hsu-Chun Yen |
On Balloon Drawings of Rooted Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 285-296, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Stephen B. Peckham |
Globally Partitionable Attribute Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAGA ![In: Attribute Grammars and their Applications, International Conference WAGA, Paris, France, September 19-21, 1990, Proceedings, pp. 327-342, 1990, Springer, 3-540-53101-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
48 | Wenxin Liang, Haruo Yokota |
Exploiting Path Information for Syntax-Based XML Subtree Matching in RDBs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: The Ninth International Conference on Web-Age Information Management, WAIM 2008, July 20-22, 2008, Zhangjiajie, China, pp. 105-112, 2008, IEEE Computer Society, 978-0-7695-3185-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Wenxin Liang, Haruo Yokota |
A Path-sequence Based Discrimination for Subtree Matching in Approximate XML Joins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE Workshops ![In: Proceedings of the 22nd International Conference on Data Engineering Workshops, ICDE 2006, 3-7 April 2006, Atlanta, GA, USA, pp. 116, 2006, IEEE Computer Society, 0-7695-2571-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Zeshan Peng, Hing-Fung Ting |
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary 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. 754-765, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Wanida Pensuwon, Rod Adams, Neil Davey |
Optimizing a Neural Tree Using Subtree Retraining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 8th International Conference, KES 2004, Wellington, New Zealand, September 20-25, 2004. Proceedings. Part III, pp. 256-262, 2004, Springer, 3-540-23205-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Hiroshi Nagamochi, Kohei Okada |
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 138-147, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
47 | Fanica Gavril |
Algorithms on Subtree Filament Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 27-35, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
subtree filament graph, dominating hole, induced split subgraph, perfect graph |
47 | Yun Chi, Yirong Yang, Richard R. Muntz |
Canonical forms for labelled trees and their applications in frequent subtree mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 8(2), pp. 203-234, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Labelled free tree, Labelled rooted unordered tree, Tree isomorphism, Canonical form, Frequent subtree |
40 | Byoungyong Lee, Kyungseo Park, Ramez Elmasri |
Reducing Energy Consumption through the Union of Disjoint Set Forests Algorithm in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking. Towards Ubiquitous Networking and Services, International Conference, ICOIN 2007, Estoril, Portugal, January 23-25, 2007. Revised Selected Papers, pp. 594-603, 2007, Springer, 978-3-540-89523-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li 0001, Weizhao Wang |
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 100-110, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Ping Guo 0003, Yang Zhou 0001, Jun Zhuang, Ting Chen, Yan-Rong Kang |
An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, First International Conference, ADMA 2005, Wuhan, China, July 22-24, 2005, Proceedings, pp. 96-107, 2005, Springer, 3-540-27894-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Biing-Feng Wang |
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(2), pp. 186-191, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Trees, cores, centers, tree contraction, the Euler-tour technique |
39 | Gabriel Valiente |
Constrained Tree Inclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 361-371, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching |
39 | Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano |
Multiple Templates Access of Trees in Parallel Memory Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 694-701, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems |
38 | Vincent Berry, Zeshan Peng, H. F. Ting |
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(3), pp. 369-385, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximum agreement subtrees, Constrained maximum agreement subtrees, Bioinformatics, Consensus, Reduction, Evolutionary trees |
38 | Oana Muntean, Laura Diosan, Mihai Oltean |
Solving the even-n-parity problems using Best SubTree Genetic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AHS ![In: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007), August 5-8, 2007, University of Edinburgh, Scotland, United Kingdom, pp. 511-518, 2007, IEEE Computer Society, 0-7695-2866-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Sylvain Guillemot, François Nicolas |
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 165-176, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Leonardo Vanneschi, Steven M. Gustafson, Giancarlo Mauri |
Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 9th European Conference, EuroGP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 238-249, 2006, Springer, 3-540-33143-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Zeshan Peng, H. F. Ting |
An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 104-115, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Brent Heeringa, Micah Adler |
Optimal Website Design with the Constrained Subtree Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 757-769, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo |
Integral Trees: Subtree Depth and Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 10th InternationalWorkshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings, pp. 77-87, 2004, Springer, 3-540-23942-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Maarten Keijzer |
Alternatives in Subtree Caching for Genetic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 7th European Conference, EuroGP2004, Coimbra, Portugal, April 5-7, 2004, Proceedings, pp. 328-337, 2004, Springer, 3-540-21346-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Riccardo Poli |
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 4th European Conference, EuroGP 2001, Lake Como, Italy, April 18-20, 2001, Proceedings, pp. 143-159, 2001, Springer, 3-540-41899-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Simon C. Roberts, Daniel Howard 0001, John R. Koza |
Evolving Modules in Genetic Programming by Subtree Encapsulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 4th European Conference, EuroGP 2001, Lake Como, Italy, April 18-20, 2001, Proceedings, pp. 160-175, 2001, Springer, 3-540-41899-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri |
Approximating the Maximum Isomorphic Agreement Subtree Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 119-128, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney |
Subtree Availability in Binary Tree Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 312-322, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
37 | Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata |
Accelerating genetic programming by frequent subtree mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 1203-1210, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
frequent subtree mining, probabilistic model building genetic programming, genetic programming, building blocks |
37 | Andrew Vince, Hua Wang |
Infinitely Many Trees Have Non-Sperner Subtree Poset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 24(2), pp. 133-138, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Sperner property, Lattice, Poset, Subtree |
35 | Jessica A. Enright, Lorna Stewart |
Subtree filament graphs are subtree overlap graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 104(6), pp. 228-232, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Josiah Carlson, David Eppstein |
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0503023, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
30 | Waraporn Viyanon, Sanjay Kumar Madria |
A system for detecting xml similarity in content and structure using relational database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 1197-1206, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
taxonomy analyzer, clustering, similarity measures, xml, keys |
30 | Show-Jane Yen, Yue-Shi Lee, Chiu-Kuang Wang, Jung-Wei Wu, Liang-Yuh Ouyang |
The Studies of Mining Frequent Patterns Based on Frequent Pattern Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 13th Pacific-Asia Conference, PAKDD 2009, Bangkok, Thailand, April 27-30, 2009, Proceedings, pp. 232-241, 2009, Springer, 978-3-642-01306-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Data Mining, Knowledge Discovery, Frequent Itemset, Frequent Pattern, Transaction Database |
30 | Roman Filipovych, Eraldo Ribeiro |
Learning Structural Models in Multiple Projection Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAR ![In: Image Analysis and Recognition, 6th International Conference, ICIAR 2009, Halifax, Canada, July 6-8, 2009. Proceedings, pp. 616-626, 2009, Springer, 978-3-642-02610-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constrained Bayesian trees, substructure discovery, E.M. algorithm, learning, motion recognition |
30 | Fedja Hadzic, Henry Tan, Tharam S. Dillon |
Mining Unordered Distance-Constrained Embedded Subtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings, pp. 272-283, 2008, Springer, 978-3-540-88410-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Juryon Paik, Junghyun Nam, Hee Yong Youn, Ung-Mo Kim |
Discovery of Useful Patterns from Tree-Structured Documents with Label-Projected Database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATC ![In: Autonomic and Trusted Computing, 5th International Conference, ATC 2008, Oslo, Norway, June 23-25, 2008, Proceedings, pp. 264-278, 2008, Springer, 978-3-540-69294-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Erik D. Demaine, Stefan Langerman, Eric Price 0001 |
Confluently Persistent Tries for Efficient Version Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 160-172, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Yamin Li, Shietung Peng, Wanming Chu |
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 53-58, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
overlay mesh, tree-core, Mobile ad hoc network (MANET), multicast, stability, efficiency |
30 | Roman Filipovych, Eraldo Ribeiro |
Discovering Constrained Substructures in Bayesian Trees Using the E.M. Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAR ![In: Image Analysis and Recognition, 5th International Conference, ICIAR 2008, Póvoa de Varzim, Portugal, June 25-27, 2008. Proceedings, pp. 650-659, 2008, Springer, 978-3-540-69811-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
constrained Bayesian trees, substructure discovery, E.M. algorithm, learning, motion recognition |
30 | Sangeetha Kutty, Tien Tran, Richi Nayak, Yuefeng Li |
Clustering XML Documents Using Closed Frequent Subtrees: A Structural Similarity Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INEX ![In: Focused Access to XML Documents, 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007, Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers, pp. 183-194, 2007, Springer, 978-3-540-85901-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
XML document mining, Frequent Mining, Structural mining, Clustering, INEX, Frequent subtrees |
30 | Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan |
Online Bandwidth Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 546-557, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti |
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 427-449, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut |
30 | James Caverlee, Ling Liu 0001 |
QA-Pagelet: Data Preparation Techniques for Large-Scale Data Analysis of the Deep Web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(9), pp. 1247-1262, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pagelets, clustering, Deep Web, data extraction, data preparation |
30 | Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher |
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (1) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I, pp. 1304-1315, 2004, Springer, 3-540-22344-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 479-490, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Frank Neven, Thomas Schwentick |
Expressive and Efficient Pattern Languages for Tree-Structured Data. ![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. 145-156, 2000, ACM, 1-58113-214-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Ming-Yang Kao |
Tree Contractions and Evolutionary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 299-310, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Magnus Bordewich, Olivier Gascuel, Katharina T. Huber, Vincent Moulton |
Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(1), pp. 110-117, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
subtree prune and regraft (SPR), BSPR algorithm, Nearest Neighbor Interchange (NNI), BNNI algorithm, balanced minimum evolution principle (BME), tree-length, quartet-distance, Robinson Foulds distance, safety radius, topological move, consistency, phylogenetic tree |
29 | Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv |
Keyword proximity search in complex data graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 927-940, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximate top-k answers, information retrieval on graphs, keyword proximity search, subtree enumeration by height, redundancy elimination |
29 | Masashi Okada, Naohiro Ishii, Nariaki Kato |
Information Extraction by XLM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based Intelligent Information and Engineering Systems, 11th International Conference, KES 2007, XVII Italian Workshop on Neural Networks, Vietri sul Mare, Italy, September 12-14, 2007. Proceedings, Part II, pp. 1051-1058, 2007, Springer, 978-3-540-74826-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
embedded subtree, information extraction, xml, tree structure |
29 | Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Matching Hierarchical Structures Using Association Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 21(11), pp. 1105-1120, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Maximal subtree isomorphisms, replicator dynamical systems, shock trees, shape recognition, maximal cliques, association graphs |
29 | Joachim Niehren, Manfred Pinkal, Peter Ruhrberg |
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-14, 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13-17, 1997, Proceedings, pp. 34-48, 1997, Springer, 3-540-63104-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
tree constraints, subtree relation, string unification, context unification, linear second-order unification, one-step rewriting, semantic processing of natural language |
29 | 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 |
28 | Lingyun Wen, Guiquan Liu, Yinghai Zhao |
HS-Model: a hierarchical statistical subtree-generating model for genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 1005-1008, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
subroutine |
28 | Wai Yin Mok |
Characterizing the MVDs That Hold in a Connected Subtree of a Join Tree: A Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 20(3), pp. 425-426, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Schema and subschema, Data dependencies, Normal forms |
28 | Tobias Achterberg, Stefan Heinz 0001, Thorsten Koch |
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings, pp. 278-282, 2008, Springer, 978-3-540-68154-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Anders Dessmark, Jesper Jansson 0001, Andrzej Lingas, Eva-Marta Lundell |
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 48(3), pp. 233-248, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Jung-Rim Kim, Hyun Sung Chang, Sang Uk Lee, Sanghoon Sull |
Efficient Subtree Pruning Scheme in Tree-Structured Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. Video Technol. ![In: IEEE Trans. Circuits Syst. Video Technol. 17(5), pp. 635-638, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Tao Jin, Yuchen Fu, Xinghong Ling, Quan Liu, Zhiming Cui |
A Method of Ontology Mapping Based on Subtree Kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IITA ![In: Proceedings of the Workshop on Intelligent Information Technology Application, IITA 2007, Zhang Jiajie, China, December 2-3, 2007, pp. 70-73, 2007, IEEE Computer Society, 0-7695-3063-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | 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 |
28 | Sun-Yuan Hsieh |
Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings, pp. 164-175, 2006, Springer, 3-540-49994-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Steven M. Gustafson, Leonardo Vanneschi |
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 8th European Conference, EuroGP2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings, pp. 178-189, 2005, Springer, 3-540-25436-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Hiroshi Nagamochi, Taizo Kawada |
Approximating the Minmax Subtree Cover Problem in a Cactus. ![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. 705-716, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang |
An Improved Algorithm for the Maximum Agreement Subtree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 19-21 March 2004, Taichung, Taiwan, pp. 533-536, 2004, IEEE Computer Society, 0-7695-2173-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximum agreement sub-tree, leaf-labelled tree, k-dimensional range search tree, k-dimensional binary search tree, Evolutionary tree |
28 | Anders Dessmark, Jesper Jansson 0001, Andrzej Lingas, Eva-Marta Lundell |
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 220-229, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Ling Chen 0006, Sourav S. Bhowmick, Liang-Tien Chia |
Mining Maximal Frequently Changing Subtree Patterns from XML Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 6th International Conference, DaWaK 2004, Zaragoza, Spain, September 1-3, 2004, Proceedings, pp. 68-76, 2004, Springer, 3-540-22937-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Alexandros Stamatakis, Thomas Ludwig 0002, Harald Meier, Marty J. Wolf |
Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the 2002 ACM/IEEE conference on Supercomputing, Baltimore, Maryland, USA, November 16-22, 2002, CD-ROM, pp. 2:1-2:16, 2002, IEEE Computer Society, 0-7695-1524-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Riccardo Poli, Jonathan E. Rowe, Christopher R. Stephens, Alden H. Wright |
Allele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 5th European Conference, EuroGP 2002, Kinsale, Ireland, April 3-5, 2002, Proceedings, pp. 212-227, 2002, Springer, 3-540-43378-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Terry Van Belle, David H. Ackley |
Uniform Subtree Mutation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroGP ![In: Genetic Programming, 5th European Conference, EuroGP 2002, Kinsale, Ireland, April 3-5, 2002, Proceedings, pp. 152-161, 2002, Springer, 3-540-43378-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 124-135, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha |
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 186-188, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dynamic multithreading, intel threading building blocks, serial-parallel reciprocity, scheduling, work stealing, cilk |
20 | Leonardo Vanneschi, Steven M. Gustafson |
Using crossover based similarity measure to improve genetic programming generalization ability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 1139-1146, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
crossover based similarity/dissimilarity measure, genetic programming, generalization |
20 | Balder ten Cate, Luc Segoufin |
XPath, transitive closure logic, and nested tree walking automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 251-260, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
tree walking automata, xpath, xml, transitive closure |
20 | Krzysztof Krawiec, PrzemysBaw Polewski |
Potential fitness for genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, Companion Material, pp. 2175-2180, 2008, ACM, 978-1-60558-131-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
semantics, genetic programming, context, evolutionary computation |
20 | Show-Jane Yen, Yue-Shi Lee, Chiu-Kuang Wang, Jung-Wei Wu |
An Efficient Approach for Mining Frequent Patterns Based on Traversing a Frequent Pattern Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSSE (4) ![In: International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 4: Embedded Programming / Database Technology / Neural Networks and Applications / Other Applications, December 12-14, 2008, Wuhan, China, pp. 354-357, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Amit Dvir, Michael Segal 0001 |
The (k, l) Coredian Tree for Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 28th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2008 Workshops), 17-20 June 2008, Beijing, China, pp. 267-272, 2008, IEEE Computer Society, 978-0-7695-3173-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Svante Janson, Wojciech Szpankowski |
Partial fillup and search time in LC tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 44, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization |
20 | Fedja Hadzic, Henry Tan, Tharam S. Dillon |
UNI3 - efficient algorithm for mining unordered induced subtrees using TMG candidate generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA, 1-5 April 2007, pp. 568-575, 2007, IEEE, 1-4244-0705-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Satisfiability of a Spatial Logic with Tree Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 130-145, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 768 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ >>] |
|