4378 search results - page 173 / 876 » On the Complexity of Ordered Colourings |
157
click to vote
PCM
2007
Springer
16 years 19 days ago
2007
Springer
This paper presents a novel frame-layer rate control technique that adaptively determines the frame complexity for bit allocation in order to satisfy the target bit-rate constraint...
170
click to vote
IRI
2006
IEEE
16 years 16 days ago
2006
IEEE
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
154
click to vote
FSE
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 ro...
188
click to vote
ISSAC
2004
Springer
15 years 12 months ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
170
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...