896 search results - page 33 / 180 » On completeness of word reversing |
158
click to vote
EG
2007
15 years 6 months ago
2007
This paper presents the findings from an exploratory in-depth case study with regard to eReverse Auctions (eRAs) in the UK public sector. These findings highlight that eRAs can im...
117
click to vote
SIAMCO
2008
15 years 6 months ago
2008
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
146
click to vote
TCS
2011
15 years 1 months ago
2011
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...
132
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Humans are able to recognise a word before its acoustic realisation is complete. This in contrast to conventional automatic speech recognition (ASR) systems, which compute the lik...
167
click to vote
LATA
2010
Springer
15 years 9 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...