402 search results - page 6 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....