994 search results - page 88 / 199 » Custom Computing Machines for the Set Covering Problem |
100
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
105
click to vote
EUROGP
2003
Springer
15 years 5 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
152
click to vote
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
110
click to vote
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
108
Voted
IJHPCA
2010
14 years 11 months ago
2010
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...