276 search results - page 20 / 56 » The Complexity of Computing Maximal Word Functions |
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
JMLR
2008
13 years 7 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
ECCC
2000
13 years 7 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
ANCS
2008
ACM
13 years 9 months ago
2008
ACM
Computer networks require increasingly complex packet processing in the data path to adapt to new functionality requirements. To meet performance demands, packet processing system...
ACL
2012
11 years 10 months ago
2012
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...