Sciweavers

92 search results - page 16 / 19
» Log-Linear Models for Label Ranking
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for distributed markov chain problems
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...
Rahul Sami, Andy Twigg
CIKM
2005
Springer
14 years 2 months ago
Discretization based learning approach to information retrieval
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...
ACL
2009
13 years 6 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
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...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
ICIP
2003
IEEE
14 years 10 months ago
Feature selection for unsupervised discovery of statistical temporal structures in video
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 ...
Lexing Xie, Shih-Fu Chang, Ajay Divakaran, Huifang...
PAMI
2007
101views more  PAMI 2007»
13 years 8 months ago
A Thousand Words in a Scene
— 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...