346 search results - page 61 / 70 » A New Approximate Maximal Margin Classification Algorithm |
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
CPM
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
UAI
2000
13 years 8 months ago
2000
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...