4767 search results - page 257 / 954 » Structures for Abstract Rewriting |
162
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...
162
click to vote
FPLE
1995
15 years 10 months ago
1995
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
284
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
176
click to vote
CCS
2009
ACM
16 years 7 months ago
2009
ACM
Inlined Reference Monitor (IRM) is an established enforcement mechanism for history-based access control policies. IRM enforcement injects monitoring code into the binary of an un...
185
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...