52 search results - page 10 / 11 » Performance of universal codes over infinite alphabets |
90
Voted
ITSL
2008
15 years 1 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...
100
Voted
IJCNN
2008
IEEE
15 years 6 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...
83
Voted
ICBA
2004
Springer
15 years 5 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...
74
Voted
LCTRTS
2004
Springer
15 years 5 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 ...
100
Voted
ICS
2009
Tsinghua U.
15 years 6 months 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 ...