836 search results - page 39 / 168 » On the Complexity of Train Assignment Problems |
111
click to vote
UAI
2004
15 years 5 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
130
Voted
MLDM
2009
Springer
15 years 10 months ago
2009
Springer
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
138
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Kernel Fisher Discriminant Analysis (KFDA) has achieved great success in pattern recognition recently. However, the training process of KFDA is too time consuming (even intractabl...
152
click to vote
EGPGV
2004
Springer
15 years 9 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
114
click to vote
PAMI
2008
15 years 3 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...