Sciweavers

310 search results - page 17 / 62
» On Sketching Quadratic Forms
Sort
View
MP
2002
176views more  MP 2002»
13 years 9 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 4 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
AAAI
2010
13 years 11 months ago
An Integrated Systems Approach to Explanation-Based Conceptual Change
Understanding conceptual change is an important problem in modeling human cognition and in making integrated AI systems that can learn autonomously. This paper describes a model o...
Scott Friedman, Kenneth D. Forbus
CG
2005
Springer
13 years 9 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja
ESANN
2007
13 years 11 months ago
Model Selection for Kernel Probit Regression
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
Gavin C. Cawley