3049 search results - page 499 / 610 » On the Convergence of Bound Optimization Algorithms |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
RECOMB
2008
Springer
14 years 9 months ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...