Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
This paper aims to find interested association rules, known as data mining technique, out of the dataset of downloading logs by focusing on the coordinated activity among downloadi...
Abstract. This paper presents a method for determining the six-degreeof-freedom (DOF) transformation between a camera and a base frame of interest, while concurrently estimating th...
We argue that programming high-end stream-processing applications requires a form of coordination language that enables the designer to represent interactions between stream-proce...
Frank Penczek, Stephan Herhut, Clemens Grelck, Sve...