109 search results - page 3 / 22 » Are Very Large N-Best Lists Useful for SMT |
ACL
2009
13 years 3 months ago
2009
This paper shows the results of an experiment in dialogue segmentation. In this experiment, segmentation was done on a level of analysis similar to adjacency pairs. The method of ...
CICLING
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Professional translators of technical documents often use Translation Memory (TM) systems in order to capitalize on the repetitions frequently observed in these documents...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
CAV
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
CATA
2000
13 years 6 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...