52 search results - page 10 / 11 » Performance of universal codes over infinite alphabets |
ITSL
2008
13 years 6 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
IJCNN
2008
IEEE
13 years 11 months ago
2008
IEEE
— Spiking neural networks have been shown capable of simulating sigmoidal artificial neural networks providing promising evidence that they too are universal function approximat...
ICBA
2004
Springer
13 years 10 months ago
2004
Springer
We apply the ETSI’s DSR standard to speaker verification over telephone networks and investigate the effect of extracting spectral features from different stages of the ETSI...
LCTRTS
2004
Springer
13 years 10 months ago
2004
Springer
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
ICS
2009
Tsinghua U.
14 years 1 days ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...