3415 search results - page 351 / 683 » Lower bounds on kernelization |
183
click to vote
CCCG
2010
15 years 8 months ago
2010
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
156
click to vote
CATS
2007
15 years 8 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
195
click to vote
CCCG
2008
15 years 8 months ago
2008
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
175
click to vote
GEM
2007
15 years 8 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
209
click to vote
NETWORKING
2007
15 years 8 months ago
2007
We re-examine the two reasons for the conservative 1-second Minimum TCP-RTO to protect against spurious timeouts: i) the OS clock granularity and ii) the Delayed ACKs. We find tha...