2485 search results - page 224 / 497 » Time Bounded Frequency Computations |
193
click to vote
APPROX
2007
Springer
16 years 23 days ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
181
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
174
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
161
click to vote
IJCAI
2003
15 years 8 months ago
2003
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
176
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...