1222 search results - page 62 / 245 » Some Results on Directable Automata |
COMPGEOM
1997
ACM
15 years 2 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
MLG
2007
Springer
15 years 3 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
103
click to vote
SACMAT
2009
ACM
15 years 4 months ago
2009
ACM
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
APIN
1998
14 years 9 months ago
1998
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...