14165 search results - page 368 / 2833 » The generalized two-server problem |
199
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
172
click to vote
SIAMNUM
2011
15 years 1 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
195
click to vote
TIP
2011
15 years 1 months ago
2011
In this paper we present a novel geometric framework called geodesic active fields for general image registration. In image registration, one looks for the underlying deformation ...
183
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
245
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...