Sciweavers

1352 search results - page 79 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
JCO
2007
128views more  JCO 2007»
13 years 8 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
PAMI
2010
168views more  PAMI 2010»
13 years 7 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
ICML
2008
IEEE
14 years 9 months ago
Listwise approach to learning to rank: theory and algorithm
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, Ha...
BMVC
2001
13 years 11 months ago
Robust Registration of 2D and 3D Point Sets
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
Andrew W. Fitzgibbon
COCOA
2008
Springer
13 years 10 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner