clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...
Carolina Galleguillos, Brian McFee, Serge Belongie...
This work presents a research on the methods and mechanisms necessary to bring the Information and Communication Technologies in the traditional classroom. This will be achieved by...
Maximiliano Paredes, Manuel Ortega, Pedro P. S&aac...
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...