Sciweavers

3373 search results - page 539 / 675
» Linear transformations on codes
Sort
View
DCC
2006
IEEE
15 years 9 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
15 years 7 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
ICCAD
2007
IEEE
124views Hardware» more  ICCAD 2007»
15 years 7 months ago
Timing budgeting under arbitrary process variations
Timing budgeting under process variations is an important step in a statistical optimization flow. We propose a novel formulation of the problem where budgets are statistical ins...
Ruiming Chen, Hai Zhou
ICASSP
2009
IEEE
15 years 4 months ago
Unsupervised equalization of Lombard effect for speech recognition in noisy adverse environment
When exposed to environmental noise, speakers adjust their speech production to maintain intelligible communication. This phenomenon, called Lombard effect (LE), is known to consi...
Hynek Boril, John H. L. Hansen
ICASSP
2009
IEEE
15 years 4 months ago
Lattice-based MLLR for speaker recognition
Maximum-Likelihod Linear Regression (MLLR) transform coefficients have shown to be useful features for text-independent speaker recognition systems. These use MLLR coefficients ...
Marc Ferras, Claude Barras, Jean-Luc Gauvain