Вычисление нулей и полюсов функций на основе устойчивой адресной сортировки с приложением к поиску и распознаванию
The article is devoted to program method of application parallelizing internal sorting on a key for localization and the approximate computation
 of polynomials` zeroes with the appendix to search and recognition. The method defines multiplicity of zeroes, it is spreaded to calculation of&am...
Збережено в:
| Дата: | 2004 |
|---|---|
| Автори: | , , , |
| Формат: | Стаття |
| Мова: | Російська |
| Опубліковано: |
Інститут програмних систем НАН України
2004
|
| Теми: | |
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/2291 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Вычисление нулей и полюсов функций на основе устойчивой адресной сортировки с приложением к поиску и распознаванию / Я.Е. Ромм, М.Ю. Гуревич, С.С. Белоконова, И.А. Соловьева// Проблеми програмування. — 2004. — N 2,3. — С. 462-472. — Бібліогр.: 14 назв. — рос. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | The article is devoted to program method of application parallelizing internal sorting on a key for localization and the approximate computation
of polynomials` zeroes with the appendix to search and recognition. The method defines multiplicity of zeroes, it is spreaded to calculation of
functions` poles taking into account its order and it is applicable to determination of functions` extremes and extremal elements of numerical sequences.
Search patterns and recognition of images to extreme attributes are under construction on this basis. Time complexity of consecutive and
parallel realization of method is estimated. Stability of the offered patterns is proved and verified experimentally.
|
|---|---|
| ISSN: | 1727-4907 |