Sciweavers

500 search results - page 24 / 100
» A parallel quadratic programming method for dynamic optimiza...
Sort
View
JMLR
2006
89views more  JMLR 2006»
14 years 11 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
EUROPAR
2006
Springer
15 years 2 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
14 years 11 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui
ICCV
2005
IEEE
16 years 1 months ago
Recovering Human Body Configurations Using Pairwise Constraints between Parts
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...
Xiaofeng Ren, Alexander C. Berg, Jitendra Malik
ESOP
1999
Springer
15 years 3 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller