2938 search results - page 133 / 588 » On obfuscating point functions |
172
click to vote
AAAI
2010
15 years 7 months ago
2010
We present an interactive learning method that enables a user to iteratively refine a regression model. The user examines the output of the model, visualized as the vertical axis ...
168
click to vote
COLING
1994
15 years 7 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
141
click to vote
TMI
2008
15 years 6 months ago
2008
For multi-pinhole SPECT, iterative reconstruction algorithms are preferred over analytical methods, because of the often complex multi-pinhole geometries and the ability of iterat...
157
click to vote
JAT
2002
15 years 6 months ago
2002
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
174
click to vote
OL
2010
15 years 4 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...