Search results for "Subtree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabeth Chang 0001	Razor: mining distance-constrained embedded subtrees.	ICDM Workshops	2006	DBLP DOI BibTeX RDF
20	Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore	On Self-stabilizing Search Trees.	DISC	2006	DBLP DOI BibTeX RDF	min-max heap, Distributed algorithm, self-stabilization, search tree
20	Benny Kimelfeld, Yehoshua Sagiv	Finding and approximating top-k answers in keyword proximity search.	PODS	2006	DBLP DOI BibTeX RDF	approximations of top-k answers, keyword proximity search, top-k answers
20	Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram	GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks.	DCOSS	2006	DBLP DOI BibTeX RDF
20	Maria Rekouts, Maxim Grinev, Alexander Boldakov	A Method for XQuery Transform Implementation Based on Shadow Mechanism.	DEXA Workshops	2006	DBLP DOI BibTeX RDF
20	Hammad Majeed, Conor Ryan	Using context-aware crossover to improve the performance of GP.	GECCO	2006	DBLP DOI BibTeX RDF	context aware crossover, destructive effects, one point crossover, standard crossover, tree context, performance, context
20	Artem Chebotko, Dapeng Liu, Mustafa Atay, Shiyong Lu, Farshad Fotouhi	Reconstructing XML Subtrees from Relational Storage of XML documents.	ICDE Workshops	2005	DBLP DOI BibTeX RDF
20	Wendy Ashlock, Dan Ashlock	Single parent genetic programming.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
20	Benny Kimelfeld, Yehoshua Sagiv	Efficiently Enumerating Results of Keyword Search.	DBPL	2005	DBLP DOI BibTeX RDF
20	Iraj Kalantari, Larry Welch	A blend of methods of recursion theory and topology: A Pi10 tree of shadow points.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	10 Trees, Recursive analysis, Recursive topology, Topology, Recursion theory
20	James Caverlee, Ling Liu 0001, David Buttler	Probe, Cluster, and Discover: Focused Extraction of QA-Pagelets from the Deep Web.	ICDE	2004	DBLP DOI BibTeX RDF
20	Eran Halperin, Richard M. Karp	Perfect phylogeny and haplotype assignment.	RECOMB	2004	DBLP DOI BibTeX RDF	entropy, haplotypes, phasing, perfect phylogeny
20	Jenn-Wei Lin	An efficient fault-tolerant multicast approach for wireless mobile systems.	ISCC	2004	DBLP DOI BibTeX RDF
20	Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda	Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents.	PAKDD	2004	DBLP DOI BibTeX RDF
20	Yaw-Ling Lin, Tsan-sheng Hsu	Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome.	ISAAC	2003	DBLP DOI BibTeX RDF
20	Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre	Software Verification with BLAST.	SPIN	2003	DBLP DOI BibTeX RDF
20	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning Trees of Supply and Demand.	ISAAC	2002	DBLP DOI BibTeX RDF	maximum partition problem, supply, algorithm, approximation, tree, demand, partition problem, FPTAS
20	Megan Thomas, Joseph M. Hellerstein	Boolean Bounding Predicates for Spatial Access Methods.	DEXA	2002	DBLP DOI BibTeX RDF
20	Xiaolin Wu 0001, Sorina Dumitrescu	On Optimal Multi-resolution Scalar Quantization.	DCC	2002	DBLP DOI BibTeX RDF
20	Laurent Alonso, René Schott	On the tree inclusion problem.	Acta Informatica	2001	DBLP DOI BibTeX RDF
20	Andrea Torsello, Edwin R. Hancock	Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling.	EMMCVPR	2001	DBLP DOI BibTeX RDF
20	David W. Embley, Y. S. Jiang, Yiu-Kai Ng	Record-Boundary Discovery in Web Documents.	SIGMOD Conference	1999	DBLP DOI BibTeX RDF	HTML
20	David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman 0001	Representing Trees of Higer Degree.	WADS	1999	DBLP DOI BibTeX RDF
20	Igor Kononenko 0001	The Minimum Description Length Based Decision Tree Pruning.	PRICAI	1998	DBLP DOI BibTeX RDF	machine learning, decision trees, MDL principle
20	Luigi Petrone	Reusing Batch Parsers as Incremental Parsers.	FSTTCS	1995	DBLP DOI BibTeX RDF	LR parsers, programming environments, parsing, incremental parsing, parse trees
20	Tatsuya Akutsu, Magnús M. Halldórsson	On the Approximation of Largest Common Subtrees and Largest Common Point Sets.	ISAAC	1994	DBLP DOI BibTeX RDF
20	Laurent Alonso, René Schott	On the Tree Inclusion Problem.	MFCS	1993	DBLP DOI BibTeX RDF
20	Pekka Kilpeläinen, Heikki Mannila	The Tree Inclusion Problem.	TAPSOFT, Vol.1	1991	DBLP DOI BibTeX RDF
20	Vassilis J. Tsotras, B. Gopinath, George W. Hart	Optimally Managing the History of an Evolving Forest.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
20	Pieter H. Hartel	The Average Size of Ordered Binary Subgraphs.	WG	1988	DBLP DOI BibTeX RDF	binary graphs Catalan statistics, combinator graph reduction, subgraphs
19	Bo Wang, Tiejun Zhao, Muyun Yang, Sheng Li 0003	Discover Linguistic Patterns in Parsed Corpus with Frequent Subrtree Mining.	WKDD	2010	DBLP DOI BibTeX RDF	linguistic patterns, subtree mining, parsing
19	Sangeetha Kutty, Richi Nayak, Yuefeng Li	XCFS: an XML documents clustering approach using both the structure and the content.	CIKM	2009	DBLP DOI BibTeX RDF	closed frequent embedded subtrees, frequent mining, structure and content, subtree mining, xml documents, clustering
19	Jinbao Li, Shouling Ji, Jinghua Zhu	Data Caching Based Queries in Multi-sink Sensor Networks.	MSN	2009	DBLP DOI BibTeX RDF	common subtree, wireless sensor networks, data caching
19	Jie Zhou, Yong-hao Ou	Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme.	ICA3PP	2009	DBLP DOI BibTeX RDF	Group Key Distribution Scheme, Key tree, Group member subtree, root ID algorithm, Chinese Remainder Theorem
19	Sangeetha Kutty, Richi Nayak, Yuefeng Li	HCX: an efficient hybrid clustering approach for XML documents.	ACM Symposium on Document Engineering	2009	DBLP DOI BibTeX RDF	frequent mining, structure and content., subtree mining, xml documents, clustering
19	Sinisa Todorovic, Narendra Ahuja	Region-Based Hierarchical Image Matching.	Int. J. Comput. Vis.	2008	DBLP DOI BibTeX RDF	Edit-distance graph matching, Many-to-many matching, Maximum subtree isomorphism, Image matching, Transitive closures, Segmentation trees, Maximum weight cliques, Association graphs
19	Magnus Bordewich, Charles Semple	Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	Rooted phylogenetic tree, reticulate evolution, agreement forest, subtree prune and regraft, hybridization network
19	Abedelaziz Mohaisen, DaeHun Nyang, YoungJae Maeng, KyungHee Lee	Structures for Communication-Efficient Public Key Revocation in Ubiquitous Sensor Network.	MSN	2007	DBLP DOI BibTeX RDF	complete subtree cover, dynamic run-length encoding, sensor network, communication efficiency, Key revocation, bit vector
19	Alexandros Agapitos, Julian Togelius, Simon M. Lucas	Evolving controllers for simulated car racing using object oriented genetic programming.	GECCO	2007	DBLP DOI BibTeX RDF	evolutionary computer games, homologous uniform crossover, subtree macro-mutation, neural networks, genetic programming, object-oriented, evolutionary robotics
19	Luay Nakhleh, Tandy J. Warnow, C. Randal Linder	Reconstructing reticulate evolution in species: theory and practice.	RECOMB	2004	DBLP DOI BibTeX RDF	gene trees, subtree prune and regraft, phylogenetic networks
19	Gabriel Valiente	On the Algorithm of Berztiss for Tree Pattern Matching.	ENC	2004	DBLP DOI BibTeX RDF	subtree isomorphism, combinatorial problems, design and analysis of algorithms, tree pattern matching
19	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
19	Tamara Munzner	H3: laying out large directed graphs in 3D hyperbolic space.	INFOVIS	1997	DBLP DOI BibTeX RDF	large directed graphs, 3D hyperbolic space, H3 layout technique, euclidean 3-space, cone tree layout algorithm, hyperbolic navigation, subtree pruning, optimization, directed graphs, data visualization, spanning tree, graph drawing, hierarchical data, node-link diagrams, visual clutter, domain-specific knowledge
19	Martin Farach, Mikkel Thorup	Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract)	FOCS	1994	DBLP DOI BibTeX RDF	evolutionary tree comparison, sparse dynamic programming, Maximum Agreement Subtree Problem, sparsification follows, Unary Weighted Bipartite Matching, dynamic program, computational biology
19	Donald M. Topkis	All-to-All Broadcast by Flooding in Communications Networks.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	worst-case time complexity, simultaneous broadcast, suboptimality, spanning subtree, computational complexity, computer networks, communications networks, adaptive routing, flooding, FIFO, ARPANET, all-to-all broadcast, LIFO
19	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
18	Shayesteh Arasti, Siavash Mirarab	Median quartet tree search algorithms using optimal subtree prune and regraft.	Algorithms Mol. Biol.	2024	DBLP DOI BibTeX RDF
18	Long Li, Yu Yang, Zhihao Hui, Bang-Bang Jin, Hua Wang, Asfand Fahad, Heng Zhang	Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs.	Appl. Math. Comput.	2024	DBLP DOI BibTeX RDF
18	Stijn Cambie, Guantao Chen, Yanli Hao, Nizamettin Tokar	Decreasing the mean subtree order by adding k edges.	J. Graph Theory	2024	DBLP DOI BibTeX RDF
18	Kotaro Shimamura, Shinya Takamaeda-Yamazaki	FS-Boost: Communication-Efficient Federated Subtree-Based Gradient Boosting Decision Trees.	CCNC	2024	DBLP DOI BibTeX RDF
18	Steven Kelk, Simone Linz, Ruben Meuwese	Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance.	Inf. Process. Lett.	2023	DBLP DOI BibTeX RDF
18	On-Hei Solomon Lo	Distribution of subtree sums.	Eur. J. Comb.	2023	DBLP DOI BibTeX RDF
18	Wei Yu 0011	Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover.	Math. Methods Oper. Res.	2023	DBLP DOI BibTeX RDF
18	Ludovic Mignot, Faissal Ouardi, Djelloul Ziadi	New Linear-time Algorithm for SubTree Kernel Computation based on Root-Weighted Tree Automata.	CoRR	2023	DBLP DOI BibTeX RDF
18	Attila Nagy, Dorina Lakatos, Botond Barta, Judit Ács	TreeSwap: Data Augmentation for Machine Translation via Dependency Subtree Swapping.	CoRR	2023	DBLP DOI BibTeX RDF
18	Julien Baste	The Leafed Induced Subtree in chordal and bounded treewidth graphs.	CoRR	2023	DBLP DOI BibTeX RDF
18	Zixiang Xian, Rubing Huang, Dave Towey, Chunrong Fang, Zhenyu Chen 0001	TransformCode: A Contrastive Learning Framework for Code Embedding via Subtree transformation.	CoRR	2023	DBLP DOI BibTeX RDF
18	Takatora Suzuki, Han Guo, Momoko Hayamizu	Rooted Almost-binary Phylogenetic Networks for which the Maximum Covering Subtree Problem is Solvable in Linear Time.	CoRR	2023	DBLP DOI BibTeX RDF
18	Ofir Arviv, Dmitry Nikolaev 0002, Taelin Karidi, Omri Abend	Improving Cross-Lingual Transfer through Subtree-Aware Word Reordering.	CoRR	2023	DBLP DOI BibTeX RDF
18	Attila Nagy, Dorina Petra Lakatos, Botond Barta, Patrick Nanys, Judit Ács	Data Augmentation for Machine Translation via Dependency Subtree Swapping.	CoRR	2023	DBLP DOI BibTeX RDF
18	Yu Yang, Bang-Bang Jin, Mei Lu, Zhihao Hui, Lu-Xuan Zhao, Hua Wang	Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
18	Fanica Gavril	Maximum max-k-clique subgraphs in cactus subtree graphs.	Discret. Math. Algorithms Appl.	2023	DBLP DOI BibTeX RDF
18	Zuwen Luo, Kexiang Xu, Stephan G. Wagner, Hua Wang 0003	On the mean subtree order of trees under edge contraction.	J. Graph Theory	2023	DBLP DOI BibTeX RDF
18	Xiaolin Chen, Guangbiao Wei, Huishu Lian	Solution to a conjecture on the mean subtree order of graphs under edge addition.	J. Graph Theory	2023	DBLP DOI BibTeX RDF
18	Tomoya Miyazaki, Kouichi Hirata	Subcaterpillar Isomorphism Between Caterpillars: Subtree Isomorphism Restricted Text and Pattern Trees to Caterpillars.	ICPRAM	2023	DBLP DOI BibTeX RDF
18	Muntasir Hoq, Sushanth Reddy Chilla, Melika Ahmadi Ranjbar, Peter Brusilovsky, Bita Akram	SANN: Programming Code Representation Using Attention Neural Network with Optimized Subtree Extraction.	CIKM	2023	DBLP DOI BibTeX RDF
18	Attila Nagy, Dorina Lakatos, Botond Barta, Judit Ács	TreeSwap: Data Augmentation for Machine Translation via Dependency Subtree Swapping.	RANLP	2023	DBLP BibTeX RDF
18	Tatsuya Kubo, Shinya Takamaeda-Yamazaki	Cachet: A High-Performance Joint-Subtree Integrity Verification for Secure Non-Volatile Memory.	COOL CHIPS	2023	DBLP DOI BibTeX RDF
18	Ofir Arviv, Dmitry Nikolaev 0002, Taelin Karidi, Omri Abend	Improving Cross-lingual Transfer through Subtree-aware Word Reordering.	EMNLP (Findings)	2023	DBLP DOI BibTeX RDF
18	Shayesteh Arasti, Siavash Mirarab	Optimal Subtree Prune and Regraft for Quartet Score in Sub-Quadratic Time.	WABI	2023	DBLP DOI BibTeX RDF
18	Prasad Ayyalasomayajula, Mahalingam Ramkumar	Optimization of Merkle Tree Structures: A Focus on Subtree Implementation.	CyberC	2023	DBLP DOI BibTeX RDF
18	Abolfazl Poureidi	On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees.	Inf. Process. Lett.	2022	DBLP DOI BibTeX RDF
18	Haikun Teng, Zhiqiang Xie, Xiaoguang Yue, Wangcheng Cao	A Flexible Integrated Scheduling Algorithm for Dynamic Determination Processing Equipment Considering the Root-Subtree Vertical and Horizontal Pre-Scheduling.	IEEE Access	2022	DBLP DOI BibTeX RDF
18	Takanori Maehara, Kazutoshi Ando	Optimal Algorithm for Finding Representation of Subtree Distance.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2022	DBLP DOI BibTeX RDF
18	Magnus Bordewich, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke	On the Maximum Agreement Subtree Conjecture for Balanced Trees.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
18	David J. Aldous	On the Largest Common Subtree of Random Leaf-Labeled Binary Trees.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
18	Jingfeng Yang, Le Zhang, Diyi Yang	SUBS: Subtree Substitution for Compositional Semantic Parsing.	CoRR	2022	DBLP DOI BibTeX RDF
18	Lu Bai 0001, Lixin Cui, Edwin R. Hancock	QESK: Quantum-based Entropic Subtree Kernels for Graph Classification.	CoRR	2022	DBLP DOI BibTeX RDF
18	Steven Kelk, Simone Linz, Ruben Meuwese	Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance.	CoRR	2022	DBLP BibTeX RDF
18	Bey-Chi Lin	Nonblocking conditions for a multicast WSW architecture based on subtree scheme for elastic optical networks.	Opt. Switch. Netw.	2022	DBLP DOI BibTeX RDF
18	Lovemore Tenha, Mingzhou Song 0001	Inference of trajectory presence by tree dimension and subset specificity by subtree cover.	PLoS Comput. Biol.	2022	DBLP DOI BibTeX RDF
18	Tomoya Miyazaki, Kouichi Hirata	Subcaterpillar Isomorphism: Subtree Isomorphism Restricted Pattern Trees To Caterpillars.	FedCSIS	2022	DBLP DOI BibTeX RDF
18	Jingfeng Yang, Le Zhang, Diyi Yang	SUBS: Subtree Substitution for Compositional Semantic Parsing.	NAACL-HLT	2022	DBLP DOI BibTeX RDF
18	Tomoya Miyazaki, Kouichi Hirata	Subcaterpillar Isomorphism: Subtree Isomorphism for Rooted Labeled Caterpillars.	WCO	2022	DBLP DOI BibTeX RDF
18	Ivan Gocev, Georgios Meditskos, Nick Bassiliades	Towards Explaining DL Non-entailments by Utilizing Subtree Isomorphisms.	iiWAS	2022	DBLP DOI BibTeX RDF
18	Chandrashekhar Meshram, Ahmed Alsanad, Jitendra V. Tembhurne, Shailendra W. Shende, Kailash Wamanrao Kalare, Sarita Gajbhiye Meshram, Muhammad Azeem Akbar, Abdu Gumaei	A Provably Secure Lightweight Subtree-Based Short Signature Scheme With Fuzzy User Data Sharing for Human-Centered IoT.	IEEE Access	2021	DBLP DOI BibTeX RDF
18	Stijn Cambie, Stephan Wagner 0003, Hua Wang 0003	On the maximum mean subtree order of trees.	Eur. J. Comb.	2021	DBLP DOI BibTeX RDF
18	Dai Hai Nguyen, Canh Hao Nguyen, Hiroshi Mamitsuka	Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels.	Mach. Learn.	2021	DBLP DOI BibTeX RDF
18	Chandrashekhar Meshram, Mohammad S. Obaidat, Cheng-Chi Lee, Sarita Gajbhiye Meshram	An Efficient, Robust, and Lightweight Subtree-Based Three-Factor Authentication Procedure for Large-Scale DWSN in Random Oracle.	IEEE Syst. J.	2021	DBLP DOI BibTeX RDF
18	Dai Hai Nguyen, Canh Hao Nguyen, Hiroshi Mamitsuka	Learning subtree pattern importance for Weisfeiler-Lehmanbased graph kernels.	CoRR	2021	DBLP BibTeX RDF
18	Justo Puerto, Federica Ricca, Andrea Scozzari	Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
18	Xiu-Mei Zhang, Hua Wang 0003, Xiao-Dong Zhang 0001	On the eccentric subtree number in trees.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
18	Tínaz Ekim, Mordechai Shalom, Oylum Seker	The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.	J. Comb. Optim.	2021	DBLP DOI BibTeX RDF
18	Ben Cameron, Lucas Mol	On the mean subtree order of graphs under edge addition.	J. Graph Theory	2021	DBLP DOI BibTeX RDF
18	Stephan G. Wagner	On the probability that a random subtree is spanning.	J. Graph Theory	2021	DBLP DOI BibTeX RDF
18	Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan	Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism.	SOSA	2021	DBLP DOI BibTeX RDF
18	Suna He, Jigang Wu, Bing Wei, Jiaxin Wu	Task Tree Partition and Subtree Allocation for Heterogeneous Multiprocessors.	ISPA/BDCloud/SocialCom/SustainCom	2021	DBLP DOI BibTeX RDF
18	Ziyu Wei, Xi Xiao, Guangwu Hu, Bin Zhang 0048, Qing Li 0006, Shutao Xia	A Novel and High-Accuracy Rumor Detection Approach using Kernel Subtree and Deep Learning Networks.	IJCNN	2021	DBLP DOI BibTeX RDF
18	Ruizhuo Zhao, Jinhua Gao, Huawei Shen, Xueqi Cheng	Capturing SQL Query Overlapping via Subtree Copy for Cross-Domain Context-Dependent SQL Generation.	PAKDD (2)	2021	DBLP DOI BibTeX RDF
18	Chandrashekhar Meshram, Cheng-Chi Lee, Abhay S. Ranadive, Chun-Ta Li, Sarita Gajbhiye Meshram, Jitendra V. Tembhurne	A subtree-based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing.	Int. J. Commun. Syst.	2020	DBLP DOI BibTeX RDF