3643 search results - page 706 / 729 » Learning Submodular Functions |
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
109
click to vote
NEUROSCIENCE
2001
Springer
15 years 2 months ago
2001
Springer
The Brain is a slow computer yet humans can skillfully play games such as tennis where very fast reactions are required. Of particular interest is the evidence for strategic thinki...
PODS
1999
ACM
15 years 2 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
ICLP
1999
Springer
15 years 2 months ago
1999
Springer
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...