Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  polynomial-time algorithm
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Error Correction for Discrete Tomography
EN
Discrete tomography focuses on the reconstruction of functions from their line sums in a finite number d of directions. In this paper we consider functions f : A → R where A is a finite subset of ℤ2 and R an integral domain. Several reconstruction methods have been introduced in the literature. Recently Ceko, Pagani and Tijdeman developed a fast method to reconstruct a function with the same line sums as f. Up to here we assumed that the line sums are exact. Some authors have developed methods to recover the function f under suitable conditions by using the redundancy of data. In this paper we investigate the case where a small number of line sums are incorrect as may happen when discrete tomography is applied for data storage or transmission. We show how less than d/2 errors can be corrected and that this bound is the best possible. Moreover, we prove that if it is known that the line sums in k given directions are correct, then the line sums in every other direction can be corrected provided that the number of wrong line sums in that direction is less than k/2. [
EN
We present an optimization-based coordination protocol among autonomous workstations in a multiprocessor stage devoted to painting of the shutters in a furniture production process. The coordination aims to maximize the number of parallel operations executable at each machine cycle, while fulfilling constraints on the unique-copy tools. The mechanism is derived by a distributed implementation of a bipartite matching algorithm. The resulting procedure is shown to be compatible with the several autonomous decisions characterizing the process.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.