Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
This paper introduces Mycrocosm, a microblogging site in which users communicate via statistical graphics, rather than the usual short text statements. Users of Mycrocosm can reco...
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
The BDI agent model comprises a simple but efficient folk psychological framework of mentalistic notions usable for modeling rational agent behaviour. Nevertheless, despite its u...
Alexander Pokahr, Lars Braubach, Winfried Lamersdo...