23 search results - page 5 / 5 » An Optimal Algorithm for the Construction of Optimal Prefix ... |
STOC
2004
ACM
14 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
PLDI
2005
ACM
13 years 11 months ago
2005
ACM
This paper introduces the concept of programming with sketches, an approach for the rapid development of high-performance applications. This approach allows a programmer to write ...
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...