16188 search results - page 2999 / 3238 » The Optimal PAC Algorithm |
152
click to vote
NAACL
2003
15 years 7 months ago
2003
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...
127
click to vote
NIPS
2003
15 years 7 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
154
click to vote
NIPS
2003
15 years 7 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
174
click to vote
AAAI
1998
15 years 7 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
165
click to vote
AAAI
1998
15 years 7 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...