994 search results - page 60 / 199 » Custom Computing Machines for the Set Covering Problem |
105
click to vote
KDD
2001
ACM
16 years 1 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
103
Voted
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
110
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
117
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
96
Voted
RANDOM
1999
Springer
15 years 5 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...