We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
We approached the problem as learning how to order documents by estimated relevance with respect to a user query. Our support vector machines based classifier learns from the rele...
Dmitri Roussinov, Weiguo Fan, Fernando A. Das Neve...
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
— This paper presents a novel approach for visual scene modeling and classification, investigating the combined use of text modeling methods and local invariant features. Our wo...
Pedro Quelhas, Florent Monay, Jean-Marc Odobez, Da...