Sciweavers

380 search results - page 6 / 76
» Mapping Problems with Finite-Domain Variables into Problems ...
Sort
View
MFCS
1998
Springer
13 years 11 months ago
Blockwise Variable Orderings for Shared BDDs
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
Harry Preuß, Anand Srivastav
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
ICASSP
2008
IEEE
14 years 1 months ago
Irrelevant variability normalization based HMM training using map estimation of feature transforms for robust speech recognition
In the past several years, we’ve been studying feature transformation (FT) approaches to robust automatic speech recognition (ASR) which can compensate for possible “distortio...
Donglai Zhu, Qiang Huo
EC
2008
153views ECommerce» more  EC 2008»
13 years 7 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
MFCS
2005
Springer
14 years 29 days ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen