Sciweavers

1622 search results - page 128 / 325
» Learning a Hidden Matching
Sort
View
IJON
2006
138views more  IJON 2006»
15 years 3 months ago
Time-series prediction using a local linear wavelet neural network
A local linear wavelet neural network (LLWNN) is presented in this paper. The difference of the network with conventional wavelet neural network (WNN) is that the connection weigh...
Yuehui Chen, Bo Yang, Jiwen Dong
CORR
2002
Springer
180views Education» more  CORR 2002»
15 years 3 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer
CORR
1999
Springer
81views Education» more  CORR 1999»
15 years 3 months ago
Inducing a Semantically Annotated Lexicon via EM-Based Clustering
We present a technique for automatic induction of slot annotations for subcategorization frames, based on induction of hidden classes in the EM framework of statistical estimation...
Mats Rooth, Stefan Riezler, Detlef Prescher, Glenn...
IJON
2011
169views more  IJON 2011»
14 years 10 months ago
Exploiting local structure in Boltzmann machines
Restricted Boltzmann Machines (RBM) are well-studied generative models. For image data, however, standard RBMs are suboptimal, since they do not exploit the local nature of image ...
Hannes Schulz, Andreas Müller 0004, Sven Behn...
INFOCOM
2009
IEEE
15 years 10 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...