1554 search results - page 155 / 311 » Parameterized Complexity and Approximation Algorithms |
98
Voted
SPIRE
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
148
click to vote
NIPS
2007
15 years 4 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
140
Voted
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
155
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
125
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...