1309 search results - page 21 / 262 » Approaching Optimality for Solving SDD Linear Systems |
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
IPMI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
ITCC
2000
IEEE
15 years 2 months ago
2000
IEEE
Using the operational matrix of an orthogonal function to perform integration for solving, identifying and optimizing a linear dynamic system has several advantages: (1) the metho...