50 search results - page 10 / 10 » Improved Algorithms for the K-Maximum Subarray Problem for S... |
STOC
2000
ACM
13 years 9 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
ECCC
2010
13 years 5 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
BMCBI
2007
13 years 5 months ago
2007
Background: Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that a...