Sciweavers

10608 search results - page 1892 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PAA
2002
13 years 10 months ago
Combining Discriminant Models with New Multi-Class SVMs
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...
Yann Guermeur
PE
1998
Springer
104views Optimization» more  PE 1998»
13 years 10 months ago
Analysis of Transient of the Datagram Traffic for a Demand Assignment TDMA
- A modified version of the datagram capacity assignment of the FODA access scheme, named FODA/IBEA, is briefly presented. The main difference from the previous version (besides th...
Nedo Celandroni
TIP
1998
125views more  TIP 1998»
13 years 10 months ago
Additive vector decoding of transform coded images
—In a standard transform coding scheme of images or video, the decoder can be implemented by a table-lookup technique without the explicit use of an inverse transformation. In th...
Siu-Wai Wu, Allen Gersho
TIT
1998
69views more  TIT 1998»
13 years 10 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
TNN
1998
111views more  TNN 1998»
13 years 10 months ago
Modular recurrent neural networks for Mandarin syllable recognition
Abstract—A new modular recurrent neural network (MRNN)based speech-recognition method that can recognize the entire vocabulary of 1280 highly confusable Mandarin syllables is pro...
Sin-Horng Chen, Yuan-Fu Liao
« Prev « First page 1892 / 2122 Last » Next »