774 search results - page 22 / 155 » A subdivision-based algorithm for the sparse resultant |
ICASSP
2011
IEEE
13 years 14 days ago
2011
IEEE
This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used...
SIAMJO
2011
13 years 3 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
EMMCVPR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
PARA
2004
Springer
14 years 2 months ago
2004
Springer
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...