225 search results - page 10 / 45 » Approximating Parameterized Convex Optimization Problems |
COCOON
2010
Springer
14 years 1 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
WSC
2008
14 years 2 days ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...