1723 search results - page 271 / 345 » Cycling in linear programming problems |
JMLR
2006
14 years 9 months ago
2006
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
TCAD
2008
14 years 9 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
SIGPRO
2010
14 years 8 months ago
2010
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
71
Voted
VTC
2010
IEEE
14 years 8 months ago
2010
IEEE
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
107
click to vote
JMLR
2012
13 years 4 days ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...