412 search results - page 18 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
132
click to vote
NIPS
2008
15 years 4 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...
124
Voted
UAI
1997
15 years 4 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...
87
Voted
CORR
2006
Springer
15 years 3 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...
123
Voted
AAAI
2012
13 years 5 months 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...
139
Voted
GLOBECOM
2009
IEEE
15 years 1 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...