Sciweavers

1957 search results - page 369 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ECCC
2010
124views more  ECCC 2010»
14 years 9 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
92
Voted
CGF
2006
183views more  CGF 2006»
14 years 9 months ago
Data-driven Local Coordinate Systems for Image-Based Rendering
Image-based representations of an object profit from known geometry. The more accurate this geometry is known, the better corresponding pixels in the different images can be align...
Gero Müller, Ralf Sarlette, Reinhard Klein
ECCC
2007
86views more  ECCC 2007»
14 years 9 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
MP
2008
126views more  MP 2008»
14 years 9 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
84
Voted
ML
2006
ACM
14 years 9 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári