Sciweavers

359 search results - page 60 / 72
» On different generalizations of episturmian words
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
CLEF
2008
Springer
13 years 9 months ago
Allomorfessor: Towards Unsupervised Morpheme Analysis
Many modern natural language processing applications would benefit from automatic morphological analysis of words, especially when dealing with morphologically rich languages. Con...
Oskar Kohonen, Sami Virpioja, Mikaela Klami
ANLP
1994
129views more  ANLP 1994»
13 years 8 months ago
Machine Translation of Sentences with Fixed Expressions
This paper presents a practical machine translation system based on sentence types for economic news stories. Conventional English-to-Japanese machine translation (MT) systems whi...
Naoto Katoh, Teruaki Aizawa
CI
2006
101views more  CI 2006»
13 years 7 months ago
Sentiment Classification of Movie Reviews Using Contextual Valence Shifters
We present two methods for determining the sentiment expressed by a movie review. The semantic orientation of a review can be positive, negative, or neutral. We examine the effect...
Alistair Kennedy, Diana Inkpen
DATE
2006
IEEE
171views Hardware» more  DATE 2006»
14 years 1 months ago
Dynamic bit-width adaptation in DCT: image quality versus computation energy trade-off
We present a dynamic bit-width adaptation scheme in DCT applications for efficient trade-off between image quality and computation energy. Based on sensitivity differences of 64 ...
Jongsun Park, Jung Hwan Choi, Kaushik Roy