175 search results - page 32 / 35 » Bounds for Permutation Rate-Distortion |
DM
1999
13 years 7 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
TIT
2011
13 years 2 months ago
2011
New families of near-complementary sequences are presented for peak power control in multicarrier communications. A framework for near-complementary sequences is given by the expl...
TOMS
2011
13 years 2 months ago
2011
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...