Sciweavers

462 search results - page 34 / 93
» Covering a Tree by a Forest
Sort
View
ACL
2009
14 years 7 months ago
Sub-Sentence Division for Tree-Based Machine Translation
Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsi...
Hao Xiong, Wenwen Xu, Haitao Mi, Yang Liu, Qun Liu
AAECC
2009
Springer
150views Algorithms» more  AAECC 2009»
15 years 4 months ago
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
Víctor Álvarez, José Á...
IJON
2010
100views more  IJON 2010»
14 years 8 months ago
Automatic detection of onset and cessation of tree stem radius increase using dendrometer data
Dendrometers are devices, which measure continuously the stem radius of a tree. In this work, we studied the use of cumulative sum (CUSUM) charts for automatically and, thus, objec...
Mikko Korpela, Harri Mäkinen, Pekka Nöjd...
GRAPHICSINTERFACE
2000
14 years 11 months ago
Multiscale Shaders for the Efficient Realistic Rendering of Pine-Trees
The frame of our work is the efficient realistic rendering of scenes containing a huge amount of data for which an a priori knowledge is available. In this paper, we present a new...
Alexandre Meyer, Fabrice Neyret
DAM
2006
191views more  DAM 2006»
14 years 9 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart