2100 search results - page 172 / 420 » Learning to rank on graphs |
160
click to vote
ACL
2008
15 years 8 months ago
2008
We extend the classical single-task active learning (AL) approach. In the multi-task active learning (MTAL) paradigm, we select examples for several annotation tasks rather than f...
151
click to vote
ICTAI
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
189
click to vote
AAAI
2008
15 years 8 months ago
2008
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...
222
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
272
click to vote
MLQ
2011
15 years 1 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...