Sciweavers

199 search results - page 30 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
ECCV
2004
Springer
14 years 9 months ago
Learning to Segment
Abstract. We describe a new approach for learning to perform classbased segmentation using only unsegmented training examples. As in previous methods, we first use training images ...
Eran Borenstein, Shimon Ullman
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 6 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
MIA
2010
170views more  MIA 2010»
13 years 2 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 2 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López