12519 search results - page 376 / 2504 » Approximation Problems Categories |
177
Voted
MOC
2000
15 years 6 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
198
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
246
click to vote
COCOON
2010
Springer
15 years 5 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
144
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
188
Voted
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...