Sciweavers

3818 search results - page 170 / 764
» Word Problems on Compressed Words
Sort
View
WORDS
2003
IEEE
15 years 11 months ago
Asynchrony and Real-Time Dependable Computing
We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...
Gérard Le Lann
FCT
2003
Springer
15 years 11 months ago
Operations Preserving Recognizable Languages
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
Jean Berstel, Luc Boasson, Olivier Carton, Bruno P...
TSD
2001
Springer
15 years 10 months ago
Text Segmentation into Paragraphs Based on Local Text Cohesion
The problem of automatic text segmentation is subcategorized into two different problems: thematic segmentation into rather large topically selfcontained sections and splitting int...
Igor A. Bolshakov, Alexander F. Gelbukh
ACL
1990
15 years 7 months ago
Automatically Extracting and Representing Collocations for Language Generation
Collocational knowledge is necessary for language generation. The problem is that collocations come in a large variety of forms. They can involve two, three or more words, these w...
Frank A. Smadja, Kathleen McKeown
CORR
2008
Springer
109views Education» more  CORR 2008»
15 years 6 months ago
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
Mordecai Golin, Xiaoming Xu, Jiajin Yu