The sample complexity of worst-case identification of F.I.R. linear systems

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3259

Full metadata record

DC Field	Value	Language
dc.contributor	Dahleh, Munther A.	-
dc.contributor	Theodosopoulos, Theodore.	-
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:36:52Z	-
dc.date	2003-04-29T15:36:52Z	-
dc.date	1992	-
dc.date.accessioned	2013-06-04T16:16:27Z	-
dc.date.available	2013-06-04T16:16:27Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3259	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Munther A. Dahleh, Theodore Theodosopoulos, John N. Tsitsiklis.	-
dc.description	Includes bibliographical references (p. 12-13).	-
dc.description	Supported by the AFOSR. AFOSR-91-0368 Supported by the NSF. 9157306-ECS ECS-8552419	-
dc.format	13 p.	-
dc.format	859008 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]	-
dc.relation	LIDS-P ; 2101	-
dc.subject	TK7855.M41 E3845 no.2101	-
dc.title	The sample complexity of worst-case identification of F.I.R. linear systems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI