A formal proof of the e-optimality of discretized pursuit algorithms

dc.contributor.author	Zhang, Xuan
dc.contributor.author	Oommen, John
dc.contributor.author	Granmo, Ole-Christoffer
dc.contributor.author	Lei, Jiao
dc.date.accessioned	2016-09-16T15:15:30Z
dc.date.accessioned	2016-10-05T12:04:09Z
dc.date.available	2016-09-16T15:15:30Z
dc.date.available	2016-10-05T12:04:09Z
dc.date.issued	2015
dc.identifier.issn	0924-669X
dc.identifier.uri	http://hdl.handle.net/11250/2413070
dc.description	-	nb_NO
dc.language.iso	eng	nb_NO
dc.title	A formal proof of the e-optimality of discretized pursuit algorithms	nb_NO
dc.type	Journal article	nb_NO
dc.type	Peer reviewed	nb_NO
dc.date.updated	2016-09-16T15:15:30Z
dc.identifier.doi	10.1007/s10489-015-0670-1
dc.identifier.cristin	1253417