7930 search results - page 156 / 1586 » Greedy in Approximation Algorithms |
163
click to vote
ICANN
2007
Springer
16 years 17 days ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
177
click to vote
PSIVT
2007
Springer
16 years 15 days ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
183
click to vote
ECCC
2006
15 years 6 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
195
click to vote
CIARP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
207
click to vote
ASAP
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...