128 search results - page 2 / 26 » Tractable Cover Compilations |
ISAAC
2010
Springer
13 years 4 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
ACL
2001
13 years 7 months ago
2001
This paper considers three assumptions conventionally made about signatures in typed feature logic that are in potential disagreement with current practice among grammar developer...
FSTTCS
2007
Springer
14 years 16 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
Publication
We present a class of models that, via a simple construction,
enables exact, incremental, non-parametric, polynomial-time,
Bayesian inference of conditional measures. The approac...
MST
2011
13 years 1 months ago
2011
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...