3415 search results - page 242 / 683 » Lower bounds on kernelization |
159
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
Abstract. In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivit...
195
click to vote
SIAMSC
2010
15 years 1 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
169
click to vote
BIBE
2005
IEEE
16 years 8 days ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
175
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
208
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...