790 search results - page 109 / 158 » Subexponential Parameterized Algorithms |
143
click to vote
DAM
2011
14 years 10 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
115
click to vote
JDA
2011
14 years 10 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
121
click to vote
CISS
2010
IEEE
14 years 6 months ago
2010
IEEE
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
146
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
156
click to vote
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Accurate prediction of user behaviors is important for many social media applications, including social marketing, personalization and recommendation, etc. A major challenge lies ...