409 search results - page 74 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In this contribution projection approximation subspace tracking using deflation (PASTD) is investigated in the context of MIMO transmit preprocessing systems by exploi...