Sciweavers

462 search results - page 3 / 93
» Covering a Tree by a Forest
Sort
View
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
12 years 9 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
ACL
2010
13 years 3 months ago
Convolution Kernel over Packed Parse Forest
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
Min Zhang, Hui Zhang, Haizhou Li
DM
2006
121views more  DM 2006»
13 years 5 months ago
The acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
Alexandre Pinlou, Eric Sopena
IJAR
2010
189views more  IJAR 2010»
13 years 4 months ago
A fuzzy random forest
Following Breiman’s methodology, we propose a multi-classifier based on a “forest” of randomly generated fuzzy decision trees, i.e., a Fuzzy Random Forest. This approach co...
Piero P. Bonissone, José Manuel Cadenas, M....
ACL
2009
13 years 3 months ago
Improving Tree-to-Tree Translation with Packed Forests
Current tree-to-tree models suffer from parsing errors as they usually use only 1best parses for rule extraction and decoding. We instead propose a forest-based tree-to-tree model...
Yang Liu, Yajuan Lü, Qun Liu