985 search results - page 135 / 197 » Piercing Convex Sets |
JUCS
2007
15 years 4 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
127
click to vote
AUTOMATICA
2004
15 years 4 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
113
click to vote
DAM
1999
15 years 4 months ago
1999
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
122
click to vote
MP
2002
15 years 4 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
138
click to vote
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...