172 search results - page 18 / 35 » Separation of Nonconvex Sets with General Augmenting Functio... |
STOC
2010
ACM
14 years 12 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
SUM
2009
Springer
14 years 2 months ago
2009
Springer
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...