8413 search results - page 1498 / 1683 » Ordering Problem Subgoals |
117
click to vote
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
We investigate the problem of learning document classifiers in a multilingual setting, from collections where labels are only partially available. We address this problem in the ...
140
click to vote
KDD
2000
ACM
15 years 7 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
144
click to vote
EUROCRYPT
1995
Springer
15 years 7 months ago
1995
Springer
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
140
click to vote
ISCA
1995
IEEE
15 years 7 months ago
1995
IEEE
Recent superscalar processors issue four instructions per cycle. These processors are also powered by highly-parallel superscalar cores. The potential performance can only be expl...
128
click to vote
AAAI
2008
15 years 6 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...