1554 search results - page 57 / 311 » Parameterized Complexity and Approximation Algorithms |
144
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
169
Voted
ISCAS
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
103
Voted
WG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
108
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
133
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...