1601 search results - page 148 / 321 » Closed Sets for Labeled Data |
185
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
157
click to vote
CICLING
2004
Springer
15 years 11 months ago
2004
Springer
When text categorization is applied to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. In this paper, we...
165
click to vote
TSD
2004
Springer
15 years 11 months ago
2004
Springer
Two sets of linguistic features are developed: The first one to estimate if a single step in a dialogue between a human being and a machine is successful or not. The second set to...
183
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper presents a new algorithm based on boosting for interactive object retrieval in images. Recent works propose ”online boosting” algorithms where weak classifier sets...
161
click to vote
COLING
2008
15 years 7 months ago
2008
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...