Sciweavers

161 search results - page 31 / 33
» Learning Finite Automata Using Label Queries
Sort
View
CGF
2011
13 years 21 hour ago
Prior Knowledge for Part Correspondence
Classical approaches to shape correspondence base their computation purely on the properties, in particular geometric similarity, of the shapes in question. Their performance stil...
Oliver van Kaick, Andrea Tagliasacchi, Oana Sidi, ...
MM
2004
ACM
152views Multimedia» more  MM 2004»
14 years 1 months ago
Manifold-ranking based image retrieval
In this paper, we propose a novel transductive learning framework named manifold-ranking based image retrieval (MRBIR). Given a query image, MRBIR first makes use of a manifold ra...
Jingrui He, Mingjing Li, HongJiang Zhang, Hanghang...
ICML
2009
IEEE
14 years 9 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
AAAI
2008
13 years 10 months ago
Concept-Based Feature Generation and Selection for Information Retrieval
Traditional information retrieval systems use query words to identify relevant documents. In difficult retrieval tasks, however, one needs access to a wealth of background knowled...
Ofer Egozi, Evgeniy Gabrilovich, Shaul Markovitch