209 search results - page 11 / 42 » The Computational Complexity of Weak Saddles |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
PRL
2007
13 years 7 months ago
2007
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
HIS
2004
13 years 9 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
MFCS
2004
Springer
14 years 25 days ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...