427 search results - page 40 / 86 » A Subexponential Bound for Linear Programming |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract-- In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analyti...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
TNN
2010
13 years 2 months ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...