115 search results - page 11 / 23 » Estimating the Lengths of Memory Words |
116
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
WIA
2007
Springer
15 years 3 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
A tool that automates the floating-point to fixed-point conversion (FFC) process for digital signal processing systems is described. The tool automatically optimizes fixed-point d...
74
Voted
FSE
2009
Springer
15 years 10 months ago
2009
Springer
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
102
click to vote
ENTCS
2007
14 years 9 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...