402 search results - page 39 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
SIGIR
1998
ACM
14 years 29 days ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
FP
1989
14 years 23 days ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
ICFEM
2007
Springer
14 years 2 months ago
2007
Springer
We present a formal, tool-supported approach to the design and maintenance of access control policies expressed in the eXtensible Access Control Markup Language (XACML). Our aim is...
AMAI
2004
Springer
13 years 8 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
AOSD
2011
ACM
13 years 3 months ago
2011
ACM
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...