985 search results - page 80 / 197 » Piercing Convex Sets |
128
click to vote
CCCG
1993
15 years 5 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
160
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
145
click to vote
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
168
click to vote
ICANN
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
147
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...