3894 search results - page 216 / 779 » Approximation Algorithms for Biclustering Problems |
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
128
click to vote
ECCC
2010
15 years 6 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
168
click to vote
ATAL
2007
Springer
16 years 22 days ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
163
click to vote
IPCO
1998
15 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
195
click to vote
ANOR
2007
15 years 6 months ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...