656 search results - page 64 / 132 » Minimal non-convex words |
NAACL
2004
14 years 11 months ago
2004
We present Minimum Bayes-Risk (MBR) decoding for statistical machine translation. This statistical approach aims to minimize expected loss of translation errors under loss functio...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
ICANN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We examine efficacy of a classifier based on average of kernel density estimators; each estimator corresponds to a different data "resolution". Parameters of th...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper addresses the problem of discriminative training of language models that does not require any transcribed acoustic data. We propose to minimize the conditional entropy ...
ALGORITHMICA
2008
14 years 10 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...