Sciweavers

559 search results - page 88 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
CVPR
1998
IEEE
14 years 10 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 months ago
An evolutionary approach for competency-based curriculum sequencing
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
Luis de Marcos, José-Javier Martínez...
ICASSP
2011
IEEE
13 years 14 days ago
An augmented Lagrangian method for video restoration
This paper presents a fast algorithm for restoring video sequences. The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of im...
Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gi...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 2 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
ICIP
2009
IEEE
13 years 6 months ago
A low-complexity reduced-reference print identification algorithm
In a print production system, the ability to match a printed document with its original electronic form enables services that improve robustness of the production process, such as...
Matthew Gaubatz, Robert Ulichney, David M. Rouse