3244 search results - page 31 / 649 » On convex complexity measures |
MIA
2010
14 years 6 months ago
2010
113
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
FSTTCS
2004
Springer
15 years 4 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
107
click to vote
COMGEO
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...