The general limited-angle problem is underdetermined and verts ร ((a / d / g), (b / e / h), (c / f / i)). This in discrete tomography. However, electron microscopy of crystals is a terminology is used in the following theorem. much more specific problem, and is subject to stringent mathematical con
โฆ LIBER โฆ
Analysis and optimization of an algorithm for discrete tomography
โ Scribed by K.J. Batenburg
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 149 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Iterative algorithm for discrete tomogra
โ
S. K. Patch
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 86 KB
Analysis of discrete optimization algori
โ
V.A. Bondarenko; A.A. Korotkin
๐
Article
๐
1981
๐
Elsevier Science
โ 412 KB
An algorithm for optimizing discrete sto
โ
V. M. Perel'muter
๐
Article
๐
1978
๐
Springer US
๐
English
โ 436 KB
A combinatorial algorithm for the discre
โ
Chai Shan; Sun Huanchun
๐
Article
๐
1997
๐
Springer
๐
English
โ 599 KB
The definition of local optimum solution of the discrete optimi:ation is first given, and then a comprehensive combinatorial algorithm is proposed in this paper. Two-level optimum method is used in the algorithm. In the first ieve optimkaiion, un approximate locai optimum solution x is found by usi
Algorithms for solving a separable probl
โ
S.I. Sergeyev
๐
Article
๐
1990
๐
Elsevier Science
โ 128 KB
A two-level delimitative and combinatori
โ
S. Chai; H. C. Sun
๐
Article
๐
1997
๐
Springer-Verlag
๐
English
โ 640 KB