Sciweavers

1536 search results - page 91 / 308
» Approximately Dominating Representatives
Sort
View
ICASSP
2009
IEEE
15 years 11 months ago
Extended VTS for noise-robust speech recognition
Model compensation is a standard way of improving the robustness of speech recognition systems to noise. A number of popular schemes are based on vector Taylor series (vts) compen...
Rogier C. van Dalen, Mark J. F. Gales
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 8 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
ICIP
2000
IEEE
16 years 6 months ago
Orthonormal Finite Ridgelet Transform for Image Compression
A finite implementation of the ridgelet transform is presented. The transform is invertible, non-redundant and achieved via fast algorithms. Furthermore we show that this transfor...
Minh N. Do, Martin Vetterli
SPIRE
2005
Springer
15 years 9 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
DISCO
1992
161views Hardware» more  DISCO 1992»
15 years 8 months ago
Combinatory Models and Symbolic Computation
We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of alge...
Karl Aberer