602 search results - page 16 / 121 » A New Approximation Method of the Quadratic Discriminant Fun... |
ECML
2007
Springer
15 years 3 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
STOC
2005
ACM
15 years 9 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 ...
SODA
2004
ACM
14 years 10 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
SIAMCO
2002
14 years 9 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...