Sciweavers

8669 search results - page 241 / 1734
» Computing matrix representations
Sort
View
FSTTCS
2009
Springer
15 years 10 months ago
Using Elimination Theory to construct Rigid Matrices
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Pa...
PDP
2008
IEEE
15 years 9 months ago
Scheduling of QR Factorization Algorithms on SMP and Multi-Core Architectures
This paper examines the scalable parallel implementation of QR factorization of a general matrix, targeting SMP and multi-core architectures. Two implementations of algorithms-by-...
Gregorio Quintana-Ortí, Enrique S. Quintana...
DIS
2006
Springer
15 years 7 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
147
Voted
JMLR
2010
147views more  JMLR 2010»
14 years 10 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
125
Voted
DCC
2007
IEEE
16 years 3 months ago
On binary signed digit representations of integers
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
Nevine Maurice Ebeid, M. Anwar Hasan