2496 search results - page 66 / 500 » On covering by translates of a set |
138
click to vote
ICGI
2010
Springer
15 years 3 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
132
click to vote
FOCM
2010
15 years 14 days ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
115
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
104
click to vote
COLING
1990
15 years 3 months ago
1990
In machine translation, parsing of long English sentences still causes some problems, whereas for short sentences a good machine translation system usually can generate readable t...
124
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Enriching a pronunciation dictionary with phonological variation is a challenging task, not yet solved despite several decades of research, in particular for speech-to-text transc...