Sciweavers

50 search results - page 5 / 10
» Learning Weights in Discrimination Functions Using a priori ...
Sort
View
ICML
2007
IEEE
14 years 7 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
CVPR
2011
IEEE
13 years 3 months ago
Learning A Discriminative Dictionary for Sparse Coding via Label Consistent K-SVD
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
Zhuolin Jiang, Zhe Lin, Larry Davis
VTC
2006
IEEE
114views Communications» more  VTC 2006»
14 years 1 months ago
A Scheduling Scheme under a Ratio Constraint for the Multiuser MIMO Systems
A scheduling scheme for MIMO systems which has the capability of obtaining multiuser diversity gain and controlling the link connection ratio among users simultaneously is proposed...
Jiwon Kang, Hakju Lee, Chungyong Lee, Young Yong K...
TNN
1998
111views more  TNN 1998»
13 years 6 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
COLT
2006
Springer
13 years 9 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth