952 search results - page 146 / 191 » Computational complexity of stochastic programming problems |
130
Voted
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
169
click to vote
CVIU
2011
14 years 6 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
115
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
148
Voted
CCIA
2010
Springer
14 years 9 months ago
2010
Springer
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is t...
124
Voted
FOSSACS
2007
Springer
15 years 8 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...