16404 search results - page 808 / 3281 » A set coverage problem |
210
click to vote
ICDM
2003
IEEE
16 years 26 days ago
2003
IEEE
There is a ever-growing need to add structure in the form of semantic markup to the huge amounts of unstructured text data now available. We present the technique of shallow seman...
185
click to vote
COCO
2001
Springer
16 years 2 days ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
177
click to vote
ICANN
2001
Springer
16 years 1 days ago
2001
Springer
Sparse kernel regressors have become popular by applying the support vector method to regression problems. Although this approach has been shown to exhibit excellent generalization...
193
click to vote
GROUP
1999
ACM
15 years 12 months ago
1999
ACM
Research into collaborative document use often concentrates on how people share document content. However, studies of real-world document practices reveal that the structures by w...
163
click to vote
ANSS
1998
IEEE
15 years 12 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...