51 search results - page 2 / 11 » Iterative construction of the optimal Bermudan stopping time |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
ICS
1995
Tsinghua U.
13 years 8 months ago
1995
Tsinghua U.
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...