Sciweavers

126 search results - page 9 / 26
» Definitional Trees
Sort
View
ACL
2010
14 years 9 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
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 9 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
CGF
2004
97views more  CGF 2004»
14 years 11 months ago
Implicit Visualization and Inverse Modeling of Growing Trees
A method is proposed for photo-realistic modeling and visualization of a growing tree. Recent visualization methods have focused on producing smoothly blending branching structure...
Callum Galbraith, Lars Mündermann, Brian Wyvi...
NAACL
2010
14 years 9 months ago
Convolution Kernels for Opinion Holder Extraction
Opinion holder extraction is one of the important subtasks in sentiment analysis. The effective detection of an opinion holder depends on the consideration of various cues on vari...
Michael Wiegand, Dietrich Klakow
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 3 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen