Sciweavers

719 search results - page 6 / 144
» Solving Sparse Linear Constraints
Sort
View
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
COR
2010
105views more  COR 2010»
13 years 10 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
CONSTRAINTS
2002
96views more  CONSTRAINTS 2002»
13 years 9 months ago
QOCA: A Constraint Solving Toolkit for Interactive Graphical Applications
We describe an object-oriented constraint solving toolkit, QOCA, designed for interactive graphical applications. It has a simple yet powerful interface based on the metric space m...
Kim Marriott, Sitt Sen Chok
SC
2009
ACM
14 years 2 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
ICIP
2009
IEEE
14 years 10 months ago
A Generic Variational Approach For Demosaicking From An Arbitrary Color Filter Array
We propose a method to demosaick images acquired with a completely arbitrary color filter array (CFA). We adopt a variational approach where the reconstructed image has maximal sm...