𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Precision, complexity, and computational schemes of the cubic algorithm

✍ Scribed by E. A. Galperin

Publisher
Springer
Year
1988
Tongue
English
Weight
869 KB
Volume
57
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Computational Complexity of Choice S
The Computational Complexity of Choice Sets
✍ Felix Brandt; Felix Fischer; Paul Harrenstein πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of

Generating cubical complexes from image
Generating cubical complexes from image data and computation of the Euler number
✍ Djemel Ziou; Madjid Allili πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 167 KB

A number of tasks in image processing and computer vision require the computation of certain topological characteristics of objects in a given image. In this paper, we introduce a new method based on the notion of the algebraic topology complex to compute the Euler number of a given object. First, w