3415 search results - page 274 / 683 » Lower bounds on kernelization |
190
Voted
TCS
2011
15 years 1 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
250
click to vote
IAJIT
2011
14 years 10 months ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
185
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
167
click to vote
MST
2010
15 years 1 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
157
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...