2218 search results - page 17 / 444 » Testing Expressibility Is Hard |
CPM
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
CHI
2007
ACM
14 years 8 months ago
2007
ACM
Interface designers normally strive for a design that minimises the user's effort. However, when the design's objective is to train users to interact with interfaces tha...
SPEECH
2010
13 years 2 months ago
2010
Despite years of speech recognition research, little is known about which words tend to be misrecognized and why. Previous work has shown that errors increase for infrequent words...
JACM
2002
13 years 7 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
BMCBI
2008
13 years 7 months ago
2008
Background: Several biological techniques result in the acquisition of functional sets of cDNAs that must be sequenced and analyzed. The emergence of redundant databases such as U...