4 search results - page 1 / 1 » Linear Discrepancy of Basic Totally Unimodular Matrices |
COMBINATORICS
2000
13 years 11 months ago
2000
We show that the linear discrepancy of a basic totally unimodular matrix A Rm
COMBINATORICA
2004
13 years 11 months ago
2004
Let p [1, [ and cp = maxa[0,1]((1 - a)ap + a(1 - a)p)1/p. We prove that the known upper bound lindiscp(A) cp for the Lp linear discrepancy of a totally unimodular matrix A is as...
NETWORKS
2006
13 years 11 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
ASPLOS
1992
ACM
14 years 3 months ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...