In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
senting them at different levels of abstraction. This can make the analysis complex and unwieldy, requiring teams of analysts to manage it. A new approach to managing the complexit...
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...