3049 search results - page 123 / 610 » On the Convergence of Bound Optimization Algorithms |
107
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a...
135
click to vote
IJCNN
2007
IEEE
15 years 11 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
145
click to vote
IEICET
2007
15 years 4 months ago
2007
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
146
click to vote
UAI
2004
15 years 6 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
247
click to vote
EMMCVPR
2011
Springer
14 years 4 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...