520 search results - page 14 / 104 » Subset Counting in Trees |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
HIPC
1999
Springer
14 years 13 hour ago
1999
Springer
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
EMNLP
2008
13 years 9 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
IJAC
2007
13 years 7 months ago
2007
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...