Sciweavers

1142 search results - page 50 / 229
» Approximability of Clausal Constraints
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
15 years 1 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
CSCLP
2004
Springer
15 years 11 months ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
CGI
2003
IEEE
15 years 9 months ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
ICASSP
2010
IEEE
15 years 6 months ago
Multiplicative update rules for nonnegative matrix factorization with co-occurrence constraints
Nonnegative matrix factorization (NMF) is a widely-used tool for obtaining low-rank approximations of nonnegative data such as digital images, audio signals, textual data, financ...
Steven K. Tjoa, K. J. Ray Liu
IJCV
1998
103views more  IJCV 1998»
15 years 5 months ago
Dense Non-Rigid Motion Estimation in Sequences of Medical Images Using Differential Constraints
We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence...
Serge Benayoun, Nicholas Ayache