895 search results - page 68 / 179 » Approximate convex decomposition |
150
click to vote
SIAMIS
2011
14 years 4 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This work addresses the problem of deciding whether a set of realizations of a vector-valued time series with unknown temporal correlation are spatially correlated or not. Speciï¬...
PKC
2007
Springer
15 years 4 months ago
2007
Springer
DamgËšard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
120
click to vote
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
DAGSTUHL
2003
14 years 11 months ago
2003
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...