412 search results - page 18 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
NIPS
2008
14 years 11 months ago
2008
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
77
Voted
UAI
1997
14 years 11 months ago
1997
This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [1...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
AAAI
2012
13 years 1 days ago
2012
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
GLOBECOM
2009
IEEE
14 years 7 months ago
2009
IEEE
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...