1281 search results - page 167 / 257 » Transliteration as Constrained Optimization |
147
click to vote
ICASSP
2009
IEEE
16 years 24 days ago
2009
IEEE
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
168
click to vote
ICASSP
2009
IEEE
16 years 24 days ago
2009
IEEE
This paper describes a way of designing modulation filter by datadriven analysis which improves the performance of automatic speech recognition systems that operate in real envir...
177
click to vote
EUROCAST
2009
Springer
16 years 18 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
155
click to vote
GECCO
2009
Springer
16 years 18 days ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
174
click to vote
SARA
2009
Springer
16 years 17 days ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...