3415 search results - page 346 / 683 » Lower bounds on kernelization |
178
click to vote
SACRYPT
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Synchronous stream ciphers need perfect synchronization between sender and receiver. In practice, this is ensured by a resync mechanism. Daemen et al. [10] first describ...
141
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we w...
128
click to vote
APCCAS
2002
IEEE
15 years 11 months ago
2002
IEEE
The pyramid networks are well-known as suitable structures for parallel computations such as image processing. This paper shows a practical 3D VLSI layout of the N-vertex pyramid ...
144
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
185
Voted
ESA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...