774 search results - page 22 / 155 » A subdivision-based algorithm for the sparse resultant |
158
click to vote
ICASSP
2011
IEEE
14 years 9 months 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...
287
click to vote
SIAMJO
2011
15 years 25 days 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...
162
click to vote
SODA
2008
ACM
15 years 7 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-...
159
click to vote
EMMCVPR
2005
Springer
15 years 11 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 ...
173
click to vote
PARA
2004
Springer
15 years 11 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...