790 search results - page 70 / 158 » Subexponential Parameterized Algorithms |
129
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
133
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
128
click to vote
SAS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
117
click to vote
IPL
2007
15 years 3 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
124
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...