Kazan Federal University Digital Repository
An algorithm for data analysis via polyhedral optimization
- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Gabidullina Z. | |
| dc.date.accessioned | 2018-04-05T07:10:28Z | |
| dc.date.available | 2018-04-05T07:10:28Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | http://dspace.kpfu.ru/xmlui/handle/net/130468 | |
| dc.description.abstract | © 2017 IEEE. We propose the novel data analysis algorithm which allows to identify exactly the position of a given point as exterior, interior, or boundary relatively to an intersection of the finite number of pattern sets. Due to the special structure of the problem under study, this algorithm can be realized not only by sequential, but also by parallel computing on the basis of appropriate model decomposition. | |
| dc.title | An algorithm for data analysis via polyhedral optimization | |
| dc.type | Conference Paper | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.source.id | SCOPUS-2017-SID85027462878 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.