402 search results - page 3 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
ICIP
2000
IEEE
14 years 7 months ago
2000
IEEE
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
ARC
2011
Springer
13 years 11 days ago
2011
Springer
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
TACAS
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
FMCAD
2007
Springer
13 years 11 months ago
2007
Springer
—Bus and interconnect protocols contain a few core operations (such as read and write transfers) whose behaviors interleave to form complex executions. Specifications of the cor...