161 search results - page 25 / 33 » Methods for convex and general quadratic programming |
111
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
DAC
2005
ACM
16 years 1 days ago
2005
ACM
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
JMLR
2010
14 years 5 months ago
2010
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...