3713 search results - page 573 / 743 » Constructing a Calculus of Programs |
APPROX
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
NIPS
2008
14 years 11 months ago
2008
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
90
Voted
OPODIS
2008
14 years 11 months ago
2008
Abstract. In this paper we use colored Petri nets (CPNs) and the supporting CPN Tools for the modeling and performance analysis of grid architectures. The notation of Petri nets is...
NAACL
2007
14 years 11 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
AAAI
2006
14 years 11 months ago
2006
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...