Sciweavers

3818 search results - page 27 / 764
» Word Problems on Compressed Words
Sort
View
CSR
2008
Springer
14 years 11 months ago
Logic and Rational Languages of Words Indexed by Linear Orderings
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...
Nicolas Bedon, Alexis Bès, Olivier Carton, ...
COLING
2008
14 years 11 months ago
Automatic Seed Word Selection for Unsupervised Sentiment Classification of Chinese Text
We describe and evaluate a new method of automatic seed word selection for unsupervised sentiment classification of product reviews in Chinese. The whole method is unsupervised an...
Taras Zagibalov, John Carroll
CORR
2011
Springer
282views Education» more  CORR 2011»
14 years 4 months ago
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
Stanley Osher, Yu Mao, Bin Dong, Wotao Yin
WWW
2007
ACM
15 years 10 months ago
Summarizing email conversations with clue words
Accessing an ever increasing number of emails, possibly on small mobile devices, has become a major problem for many users. Email summarization is a promising way to solve this pr...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
CSL
2010
Springer
14 years 10 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis