45 search results - page 2 / 9 » Improved Deterministic Algorithms for Linear Programming in ... |
BROADNETS
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
VALUETOOLS
2006
ACM
13 years 11 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...