1278 search results - page 109 / 256 » The Complexity of Weighted Boolean |
106
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
130
Voted
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
128
Voted
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
117
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
101
Voted
CPM
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...