Sciweavers

656 search results - page 27 / 132
» Marrying Words and Trees
Sort
View
COLING
2010
15 years 1 months ago
Tree Topological Features for Unlexicalized Parsing
As unlexicalized parsing lacks word token information, it is important to investigate novel parsing features to improve the accuracy. This paper studies a set of tree topological ...
Samuel W. K. Chan, Lawrence Y. L. Cheung, Mickey W...
IBERAMIA
2010
Springer
15 years 4 months ago
Text-to-Text Surface Realisation Using Dependency-Tree Replacement
Surface realisation - the task of producing word strings from non-linguistic input data - has been the focus of a great deal of research in the field of data-to-text Natural Langu...
Eder Miranda de Novais, Thiago Dias Tadeu, Ivandr&...
ICIP
2007
IEEE
16 years 14 days ago
Dual-Layer Visual Vocabulary Tree Hypotheses for Object Recognition
This paper introduces an efficient method to substantially increase the recognition performance of a vocabulary tree based recognition system. We propose to enhance the hypothesi...
Sandra Ober, Martin Winter, Clemens Arth, Horst Bi...
DAM
2007
74views more  DAM 2007»
15 years 6 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
15 years 6 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
Sanjiv Kapoor, H. Ramesh