1139 search results - page 103 / 228 » Bounded Ideation Theory |
137
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
207
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
There is a clear intuitive connection between the notion of leakage of information in a program and concepts from information theory. This intuition has not been satisfactorily pi...
147
click to vote
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
114
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
109
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...