Sciweavers

598 search results - page 13 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
LATIN
2010
Springer
15 years 6 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
CVPR
2010
IEEE
15 years 7 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
CORR
2007
Springer
136views Education» more  CORR 2007»
14 years 11 months ago
Sparsity in time-frequency representations
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
Götz E. Pfander, Holger Rauhut
BMCBI
2011
14 years 6 months ago
Multivariate analysis of microarray data: differential expression and differential connection
Background: Typical analysis of microarray data ignores the correlation between gene expression values. In this paper we present a model for microarray data which specifically all...
Harri T. Kiiveri
ISVLSI
2007
IEEE
100views VLSI» more  ISVLSI 2007»
15 years 6 months ago
Vector Processing Support for FPGA-Oriented High Performance Applications
In this paper, we propose and implement a vector processing system that includes two identical vector microprocessors embedded in two FPGA chips. Each vector microprocessor suppor...
Hongyan Yang, Shuai Wang, Sotirios G. Ziavras, Jie...