778 search results - page 50 / 156 » Bounding Smooth Integers |
ECCV
1994
Springer
14 years 9 months ago
1994
Springer
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
ORL
2011
13 years 2 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
JMLR
2012
11 years 10 months ago
2012
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
ADCM
2006
13 years 7 months ago
2006
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all baryc...
JC
2006
13 years 7 months ago
2006
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...