3415 search results - page 205 / 683 » Lower bounds on kernelization |
150
click to vote
WOWMOM
2006
ACM
16 years 3 days ago
2006
ACM
In this paper, we build on known bounds on localization in sensor networks and provide new insights that can be used in multiple-access design from a localization perspective. Spe...
157
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
131
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
164
click to vote
UAI
2003
15 years 7 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
144
click to vote
TVLSI
2008
15 years 6 months ago
2008
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Max...