Sciweavers

2239 search results - page 4 / 448
» Computing with abstract matrix structures
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
15 years 11 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
IEEEMSP
2002
IEEE
110views Multimedia» more  IEEEMSP 2002»
15 years 2 months ago
Summarizing video using non-negative similarity matrix factorization
Abstract— We present a novel approach to automatically extracting summary excerpts from audio and video. Our approach is to maximize the average similarity between the excerpt an...
Matthew L. Cooper, Jonathan Foote
SIAMMAX
2010
116views more  SIAMMAX 2010»
14 years 4 months ago
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
Amir Beck, Yonina C. Eldar
ICS
1999
Tsinghua U.
15 years 2 months ago
High-level semantic optimization of numerical codes
This paper presents a mathematical framework to exploit the semantic properties of matrix operations in loop-based numerical codes. The heart of this framework is an algebraic lan...
Vijay Menon, Keshav Pingali
ICPP
2008
IEEE
15 years 4 months ago
Improving the Performance of Multithreaded Sparse Matrix-Vector Multiplication Using Index and Value Compression
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
Kornilios Kourtis, Georgios I. Goumas, Nectarios K...