Computational experiments for the problem of selection of a minimal set of visual landmarks

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/51219

Title:	Computational experiments for the problem of selection of a minimal set of visual landmarks
Authors:	Gorbenko, A. Popov, V.
Issue Date:	2012
Publisher:	Elsevier
Citation:	Gorbenko A. Computational experiments for the problem of selection of a minimal set of visual landmarks / Anna Gorbenko, Vladimir Popov // Applied Mathematical Sciences. — 2012. — Vol. 6. — № 113-116. — P. 5775-5780.
Abstract:	In this paper we consider an approach to solve the problem of selection of a minimal set of landmarks. Our approach is based on constructing intelligent algorithms to solve logical models for the problem.
Keywords:	LANDMARKS SELECTION NP-COMPLETE VISUAL LANDMARKS
URI:	http://elar.urfu.ru/handle/10995/51219
SCOPUS ID:	84867323564
PURE ID:	1073549
ISSN:	1312-885X
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
2-s2.0-84867323564.pdf		80,58 kB	Adobe PDF	View/Open