In the early 1970’s Gilbert introduced n-tuple colorings of graphs motivated by practical problems. After this Saul Stahl studied properties these and formulated conjecture on multichromatic number Kneser graphs. Motivated Stahl’s we will investigate almost s-stable

We present a generalization of the Viterbi algorithm for identifying the path with minimal (resp. maximal) weight in a n-tape weighted finite-state machine (n-WFSM), that accepts a given n-tuple of input strings 〈s1, . . . sn〉. It also allows us to compile the best transduction of a given input n-tuple by a weighted (n+m)-WFSM (transducer) with n input and m output tapes. Our algorithm has a wo...

Krommydas, Ioannis, Evagelos, Georgia. MSc, Computer Science Department, University of Ioannina, Greece. June, 2008. Approximate Joins for Relational Data. Thesis Supervisor: Vassiliadis Panos. Relational databases often contain duplicate data entries. This may occur due to a variety of reasons, such as typographical errors, multiple conventions for recording database fields or other noise sour...

Top-k queries allow end-users to focus on the most important (top-k) answers amongst those which satisfy the query. In traditional databases, a user defined score function assigns a score value to each tuple and a top-k query returns k tuples with the highest score. In uncertain database, top-k answer depends not only on the scores but also on the membership probabilities of tuples. Several top...

A finite recurrent system over the power set of the natural numbers of dimension n is a pair composed of n n-ary functions over the power set of the natural numbers and an n-tuple of singleton sets of naturals. Every function is applied to the components of the tuple and computes a set of natural numbers, that might also be empty. The results are composed into another tuple, and the process is ...

Java-based tuplespaces provide a simple infrastructure for scientific distributed computing. There are several classes of problems that are not efficiently solvable in JavaSpaces model of computation while efficiently solvable in other tuplespace implementation. JavaSpaces can be used for high performance computing if viewed less strictly in the heritage of Linda and more as a platform-neutral ...

Data uncertainty is an intrinsic property in different applications such as sensor network monitoring, object recognition, location-based services (LBS), and moving object tracking. The data mining methods are applied to the above mentionedapplications their uncertainty has to be handled to achieve the accurate query results. The several probabilistic algorithm estimates the location and contro...

The development of the idea of coordination languages, as deened by Carriero and Gelernter 8], has enabled work in concurrency to abstract away from the internals of processes or agents and hence to focus on their external interactions. A variety of practical parallel and/or distributed systems have resulted from the application of the coordination language concept | the most widely-known of th...

Linda Gel85, CG89] is a coordination language providing generative communication via tuple spaces. Each tuple space is a global associative memory consisting of a bag (or multi-set) of tuples, where the tuples are variable-sized objects. Repeated insertions and removals of variable-sized tuples are liable to result in the memory containing several small areas of free memory to which larger, var...