Sciweavers

656 search results - page 1 / 132
» Minimal non-convex words
Sort
View
TCS
2011
12 years 12 months ago
Minimal non-convex words
Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language forms an ideal whose minimal...
Xavier Provençal
DAM
2011
13 years 1 hour ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
JMMA
2010
162views more  JMMA 2010»
12 years 11 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
INTERSPEECH
2010
12 years 12 months ago
On the relation of Bayes risk, word error, and word posteriors in ASR
In automatic speech recognition, we are faced with a wellknown inconsistency: Bayes decision rule is usually used to minimize sentence (word sequence) error, whereas in practice w...
Ralf Schlüter, Markus Nußbaum-Thom, Her...
WWW
2011
ACM
12 years 12 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...