Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/93197Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Barabanov, A. E. | - |
| dc.date.accessioned | 2014-04-02T09:32:54Z | - |
| dc.date.available | 2014-04-02T09:32:54Z | - |
| dc.date.issued | 2007 | - |
| dc.identifier.uri | http://elib.bsu.by/handle/123456789/93197 | - |
| dc.description.abstract | An automatic partitioning algorithm is described that decomposed an arbitrary program text into a tree structure of objects that are extracted by analysis of information flows. The algoritrhm was implemented for standard functions in signal processing. The aim of the decomposition is development of the semantic network that is a self-tuning solver in a specific scientific field. | ru |
| dc.language.iso | en | ru |
| dc.publisher | Minsk: BSU | ru |
| dc.subject | ЭБ БГУ::ОБЩЕСТВЕННЫЕ НАУКИ::Информатика | ru |
| dc.title | Semantic Network in Signal Processing and Identification Theory | ru |
| dc.type | conference paper | ru |
| Appears in Collections: | PLENARY LECTURES | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.