4843 search results - page 352 / 969 » The Shortcut Problem - Complexity and Approximation |
124
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
164
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
119
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
123
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
137
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...