We introduce a convex relaxation framework to optimally
minimize continuous surface ratios. The key idea is to minimize
the continuous surface ratio by solving a sequence
of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Minimization methods for training feed-forward networks with Backpropagation are compared. Feedforward network training is a special case of functional minimization, where no expli...
Syed Muhammad Aqil Burney, Tahseen Ahmed Jilani, C...
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
Lilia Georgieva, Ullrich Hustadt, Renate A. Schmid...
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...