539 search results - page 64 / 108 » An Improved Upper Bound for SAT |
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless ch...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
DCC
2010
IEEE
13 years 11 months ago
2010
IEEE
We propose a linear predictive quantization system for causally transmitting parallel sources with temporal memory (colored frames) over an erasure channel. By optimizing within t...
CCCG
2003
13 years 9 months ago
2003
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...