Sciweavers

1182 search results - page 67 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ICML
2007
IEEE
16 years 2 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov
COLING
2010
14 years 9 months ago
Automatic analysis of semantic similarity in comparable text through syntactic tree matching
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
Erwin Marsi, Emiel Krahmer
NIPS
2008
15 years 3 months ago
Deflation Methods for Sparse PCA
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
Lester Mackey
CVPR
2006
IEEE
16 years 4 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
CVPR
2008
IEEE
16 years 4 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal