1092 search results - page 125 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
163
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Mass spectrometry (MS) is an essential analytical tool in proteomics. Many existing algorithms for peptide detection are based on isotope template matching and usually...
155
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
159
click to vote
ECCC
1998
15 years 5 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
183
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
190
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper addresses the problem of automatic reconstruction of a 3D relief from a line drawing on top of a given base object. Reconstruction is challenging due to four reasons â€...