Sciweavers

274 search results - page 46 / 55
» Counting lattice vectors
Sort
View
ICASSP
2009
IEEE
16 years 27 days 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
STACS
2005
Springer
15 years 11 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek
CC
2004
Springer
115views System Software» more  CC 2004»
15 years 11 months ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister
ICFP
1997
ACM
15 years 10 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
COOPIS
2004
IEEE
15 years 10 months ago
Service Graphs for Building Trust
Information systems must establish trust to cooperate effectively in open environments. We are developing an agent-based approach for establishing trust, where information systems ...
Pinar Yolum, Munindar P. Singh