Sciweavers

774 search results - page 7 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
JSC
2007
106views more  JSC 2007»
13 years 8 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
JSC
2008
78views more  JSC 2008»
13 years 8 months ago
Rational Univariate Reduction via toric resultants
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
Koji Ouchi, John Keyser
ICASSP
2011
IEEE
13 years 12 days ago
Sparse channel estimation with lp-norm and reweighted l1-norm penalized least mean squares
The least mean squares (LMS) algorithm is one of the most popular recursive parameter estimation methods. In its standard form it does not take into account any special characteri...
Omid Taheri, Sergiy A. Vorobyov
ICCV
2009
IEEE
13 years 6 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
ICASSP
2011
IEEE
13 years 12 days ago
Spatially sparsed Common Spatial Pattern to improve BCI performance
Common Spatial Pattern (CSP) is widely used in discriminating two classes of EEG in Brain Computer Interface applications. However, the performance of the CSP algorithm is affecte...
Mahnaz Arvaneh, Cuntai Guan, Kai Keng Ang, Hiok Ch...