We study space-efficient algorithm for computing a centerpoint for a set P of n points in R, where the points in P are given in a read-only array. We propose an algorithm that finds a centerpoint of P in O(T (n) log n) time using O(S(n)) extra space, where T (n) and S(n) are the time and extra space complexities of computing the median among a set of n elements stored in a read-only array.

Web applications have evolved from simple read-only websites to complex dataand operation-intensive systems. The main goal of this kind of application is to provide the users with services that assist them in carrying out activities according to a given set of business rules. The addition of transactions to modern web applications poses new challenges, such as managing the interplay between bus...

Current workflow management technology offers rich support for process-oriented coordination of distributed teamwork. In this paper, we evaluate the performance of an industrial workflow process where similar tasks can be performed by various actors at many different locations. We analyzed a large workflow process log with state-of-the-art mining tools associated with the ProM framework. Our an...

In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types ω0 . . . ωN−1. The opponent is assumed to adopt at every move one of the opponent types ωi according to the probability Pr(ωi). We hypothesize that PrOM search is a better search mechanism than Opponent-Model search (OM search) and Minimax search. In this paper we investigate two...

The efficiency of the traditional DDFS is greatly depends on the large size of memory. The ROM less architecture for generating sine wave and its necessary corrective measure based on parabola has already been developed. This paper proposes a modified parabola by adding a triangular wave to achieve a sine wave with less distortion. This architecture gives better performance.

Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-only and write-only channel types, as well as boolean combinations of types. A set-theoretic interpretation of types is provided, in which boolean ...

Smartcard chips vendors have always done their best to embed more memory inside cards. These efforts are driven to allow their customers smartcard manufacturers to mask more software inside cards (in ROM) but, above all, to help them to provide cards with more memory dedicated to the application (EEPROM). Even if the geometry is getting smaller and smaller, some applications do not match with t...

An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We present a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices that runs in O(n/s+ n logn log(n/s)) expected time using O(s) variables, for any s ≤ n. In particular, when s ≤ n logn log5 lo...