Results 1 
5 of
5
DoubleExponential Complexity of Computing a Complete Set of ACUnifiers
 In Proceedings 7th IEEE Symposium on Logic in Computer Science
"... A new algorithm for computing a complete set of unifiers for two terms involving associativecommutative function symbols is presented. The algorithm is based on a nondeterministic algorithm given by the authors in 1986 to show the NPcompleteness of associativecommutative unifiability. The algori ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
(Show Context)
A new algorithm for computing a complete set of unifiers for two terms involving associativecommutative function symbols is presented. The algorithm is based on a nondeterministic algorithm given by the authors in 1986 to show the NPcompleteness of associativecommutative unifiability. The algorithm is easy to understand, its termination can be easily established. More importantly, its complexity can be easily analyzed and is shown to be doubly exponential in the size of the input terms. The analysis also shows that there is a doubleexponential upper bound on the size of a complete set of unifiers of two input terms. Since there is a family of simple associativecommutative unification problems which have complete sets of unifiers whose size is doubly exponential, the algorithm is optimal in its order of complexity in this sense. This is the first associativecommutative unification algorithm whose complexity has been completely analyzed. The approach can also be used to show a singl...
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management
 In Proc. of Concur’03, volume 2761 of LNCS
, 2003
"... We consider the problem of parametric verification over a class of systems of processes competing for access to shared resources. We suppose the access to the resources to be controlled according to a FIFObased policy with a possibility of distinguishing lowpriority and highpriority resource r ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
We consider the problem of parametric verification over a class of systems of processes competing for access to shared resources. We suppose the access to the resources to be controlled according to a FIFObased policy with a possibility of distinguishing lowpriority and highpriority resource requests.
RealTime LowFrequency Signal Modulated Texture Compression using Intensity Dilation
"... We present a realtime algorithm for compressing textures based on low frequency signal modulated (LFSM) texture compression. Our formulation is based on intensity dilation and exploits the notion that the most important features of an image are those with high contrast ratios. We present a simple t ..."
Abstract
 Add to MetaCart
We present a realtime algorithm for compressing textures based on low frequency signal modulated (LFSM) texture compression. Our formulation is based on intensity dilation and exploits the notion that the most important features of an image are those with high contrast ratios. We present a simple two pass algorithm for propagating the extremal intensity values that contribute to these contrast ratios into the compressed encoding. We use our algorithm to compress PVRTC textures in realtime and compare our performance with prior techniques in terms of speed and quality.