Flexible Tree Matching
暂无分享,去创建一个
Tim Roughgarden | Ranjitha Kumar | Scott R. Klemmer | Salman Ahmad | Jerry O. Talton | T. Roughgarden | Ranjitha Kumar | Salman Ahmad
[1] Ranjitha Kumar,et al. Bricolage: example-based retargeting for web design , 2011, CHI.
[2] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[3] Kaizhong Zhang,et al. On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..
[4] Erik D. Demaine,et al. An Optimal Decomposition Algorithm for Tree Edit Distance , 2007, ICALP.
[5] Philip Bille,et al. A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..
[6] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.
[7] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[8] Hector Garcia-Molina,et al. Meaningful change detection in structured data , 1997, SIGMOD '97.
[9] Kaizhong Zhang,et al. Exact and approximate algorithms for unordered tree matching , 1994, IEEE Trans. Syst. Man Cybern..
[10] Michael Collins,et al. Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms , 2002, EMNLP.
[11] J. E. Glynn,et al. Numerical Recipes: The Art of Scientific Computing , 1989 .