Fast and Accurate Inference of Plackett-Luce Models
Related publications (34)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Distributed co-ordination is the result of dynamical processes enabling independent agents to coordinate their actions without the need of a central co-ordinator. In the past few years, several computational models have illustrated the role played by such ...
The paper contains description of the implementation of C code for tree representation of Markov Chain Monte Carlo(MCMC) clustering. The aim of the code is to produce results which helps in visual representation of the most frequent pattern, its agglomerat ...
This paper presents a novel algorithm for robust object recognition. We propose to model the visual appearance of objects via probability density functions. The algorithm consists of a fully connected Markov random field with energy function derived from r ...
We explore the scheduling rules and the hedging levels that can be obtained by using a Restless Bandit Problem formulation of a make-to-stock production. The underlying dynamics are markov chain in continuous lime and the associate reward are piecewise lin ...
In this paper we propose a method to segment and recognize text embedded in video and images. We modelize the gray level distribution in the text images as mixture of gaussians, and then assign each pixel to one of the gaussian layer. The assignment is bas ...
Abstraction techniques based on simulation relations have become an important and effective proof technique to avoid the infamous state space explosion problem. In the context of Markov chains, strong and weak simulation relations have been proposed ((B. J ...
In this paper we propose a method to segment and recognize text embedded in video and images. We modelize the gray level distribution in the text images as mixture of gaussians, and then assign each pixel to one of the gaussian layer. The assignment is bas ...
In this study, chaotic wandering phenomenon observed in simple coupled chaotic circuits is modeled by Markov chains. As coupling parameter increases, the solution of the coupled chaotic circuits starts to wander chaotically over 6 different phase states wh ...
Mixture models form the essential basis of data clustering within a statistical framework. Here, the estimation of the parameters of a mixture of Gaussian densities is considered. In this particular context, it is well known that the maximum likelihood app ...
We explore the scheduling rules and the hedging levels that can be obtained by using a restless bandit problem formulation of a make-to-stock production. The underlying dynamics are a Markov chain in continuous time and the associated rewards are piecewise ...