1389 search results - page 43 / 278 » Improved Approximation Algorithms for Label Cover Problems |
169
Voted
ACL
2006
15 years 4 months ago
2006
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
143
Voted
ICMCS
2008
IEEE
15 years 9 months ago
2008
IEEE
An algorithm for extracting music fingerprints directly from an audio signal is proposed in this paper. The proposed music fingerprint aims to encapsulate various aspects of mus...
118
click to vote
IPCO
1993
15 years 3 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
120
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
122
click to vote
NIPS
2004
15 years 3 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...