217 search results - page 19 / 44 » Circuit Complexity of Regular Languages |
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
– Clocking is an essential component of any embedded system design. However, traditional design techniques are either short of clocking support or too complex for users. The Unif...
115
Voted
SODA
2010
ACM
15 years 6 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, ...
197
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
102
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
82
Voted
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...