3415 search results - page 139 / 683 » Lower Bounds for Kernelizations |
111
click to vote
CONTEXT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Context-aware systems must be able to deal with uncertain context information. We propose a generic context architecture and representation that incorporates the uncertai...
140
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
182
click to vote
MFCS
2001
Springer
15 years 9 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
163
click to vote
COCO
1993
Springer
15 years 8 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
146
click to vote
PLDI
1993
ACM
15 years 8 months ago
1993
ACM
This paper shows how to software pipeline a loop for minimal register pressure withoutsacrificing the loop’s minimum execution time. This novel bidirectional slack-scheduling m...