895 search results - page 26 / 179 » Approximate convex decomposition |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
JSAC
2006
14 years 9 months ago
2006
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
ICIP
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an approach to decomposing branching volume data into sub-branches. First, a metric is proposed for evaluating local convexities in volumetric data, and it is a criteri...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The main contribution presented here is an adaptive/unsupervised iterative thresholding algorithm for sparse representation of signals which can be modeled as the sum of two compo...
113
click to vote
SIAMJO
2011
14 years 14 days ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...