Sciweavers

774 search results - page 32 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
RLS-weighted Lasso for adaptive estimation of sparse signals
The batch least-absolute shrinkage and selection operator (Lasso) has well-documented merits for estimating sparse signals of interest emerging in various applications, where obse...
Daniele Angelosante, Georgios B. Giannakis
EUROPAR
2006
Springer
14 years 13 days ago
Parallel Solution of Large-Scale and Sparse Generalized Algebraic Riccati Equations
We discuss a parallel algorithm for the solution of large-scale generalized algebraic Riccati equations with dimension up to O(105 ). We survey the numerical algorithms underlying ...
José M. Badía, Peter Benner, Rafael ...
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 8 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...

Publication
433views
14 years 5 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 9 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh