Sciweavers

774 search results - page 39 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
ICA
2007
Springer
14 years 20 days ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
DAM
2008
145views more  DAM 2008»
13 years 8 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug
NIPS
2000
13 years 10 months ago
Sparse Representation for Gaussian Process Models
We develop an approach for a sparse representation for Gaussian Process (GP) models in order to overcome the limitations of GPs caused by large data sets. The method is based on a...
Lehel Csató, Manfred Opper
ICIP
2007
IEEE
14 years 10 months ago
Color Image Denoising via Sparse 3D Collaborative Filtering with Grouping Constraint in Luminance-Chrominance Space
We propose an effective color image denoising method that exploits ltering in highly sparse local 3D transform domain in each channel of a luminance-chrominance color space. For e...
Kostadin Dabov, Alessandro Foi, Vladimir Katkovnik...