3415 search results - page 438 / 683 » Lower bounds on kernelization |
192
click to vote
JC
2007
15 years 6 months ago
2007
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
168
click to vote
TMC
2008
15 years 6 months ago
2008
This paper addresses the problem of data acquisition in ad hoc and sensor networks with mobile sinks and proposes a protocol based on swarm intelligence, SIMPLE, to route data in s...
189
click to vote
JGAA
2007
15 years 6 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
182
click to vote
JNW
2007
15 years 6 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
149
click to vote
TSP
2008
15 years 6 months ago
2008
A new scheme for sinusoidal audio coding named multiple description spherical trellis-coded quantization is proposed and analytic expressions for the point densities and expected d...