| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436103 | Theoretical Computer Science | 2009 | 8 Pages |
Abstract
We present two new algorithms for the range-efficient F0 estimating problem and improve the previously best known result, proposed by Pavan and Tirthapura in 2005. Furthermore, our algorithms can be applied to improve the previously best known result for the Max-Dominance Norm Problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
