3415 search results - page 193 / 683 » Lower bounds on kernelization |
150
Voted
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
153
click to vote
JSYML
2008
15 years 6 months ago
2008
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI technique...
167
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
Gaussian filtering in one, two or three dimensions is among the most commonly needed tasks in signal and image processing. Finite impulse response filters in the time domain with ...
259
click to vote
ICDT
2009
ACM
16 years 6 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...