3415 search results - page 411 / 683 » Lower bounds on kernelization |
124
click to vote
COLT
2004
Springer
16 years 13 hour ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
160
click to vote
CPM
2004
Springer
16 years 12 hour ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
166
click to vote
ESA
2004
Springer
16 years 8 hour ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
139
click to vote
FSE
2004
Springer
16 years 5 hour ago
2004
Springer
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n LFSRs, an algebraic equation relating the key strea...
175
click to vote
IMR
2004
Springer
15 years 12 months ago
2004
Springer
We introduce an indexing scheme for the vertices of semi-regular meshes, based on interleaving quadtrees rooted on the edges of the base mesh. Using this indexing scheme we develo...