164 search results - page 14 / 33 » Improved upper bounds on sizes of codes |
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
ALGORITHMICA
2004
14 years 9 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
EUROPAR
2004
Springer
15 years 2 months ago
2004
Springer
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...