Sciweavers

25 search results - page 1 / 5
» Probe Matrix Problems: Totally Balanced Matrices
Sort
View
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
13 years 11 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
CF
2006
ACM
13 years 10 months ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
SIAMMAX
2010
116views more  SIAMMAX 2010»
12 years 11 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
IWQOS
2005
Springer
13 years 10 months ago
Designing a Predictable Internet Backbone with Valiant Load-Balancing
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...
Rui Zhang-Shen, Nick McKeown
PDP
2010
IEEE
13 years 11 months ago
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
Bora Ucar, Ümit V. Çatalyürek