197 search results - page 3 / 40 » A Parallel Algorithm for Solving Large Convex Minimax Proble... |
ICML
2008
IEEE
14 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
CVPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
GECCO
2005
Springer
13 years 12 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
SIAMIS
2011
13 years 1 months ago
2011
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...