1651 search results - page 110 / 331 » Measuring the Complexity of Classification Problems |
SPEECH
2010
13 years 2 months ago
2010
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
EOR
2006
13 years 8 months ago
2006
We propose a multivariate statistical framework for regional development assessment based on structural equation modelling with latent variables and show how such methods can be c...
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...