<rdf:RDF xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/burst/user/smicha/squares"><title>BibSonomy publications for /user/smicha/squares</title><link>http://www.bibsonomy.org/burst/user/smicha/squares</link><description>BibSonomy BuRST Feed for /user/smicha/squares</description><dc:date>2008-07-26T04:37:34+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/264392165113ce4f94890d21237283572/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/258efce1e4047e6e2cb333c2489a2fbf5/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24063681c0f21bf58ebac8885a13d75c0/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20822f66f6dbb93b2257e9f34b798e9f8/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26dd1eaa1dcf1bfadb89b5432832dbb8c/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2378605d59cb37e4f5ae277a77f46d61e/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2520554b1b3f4586f35f202621c1e09a6/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2233eab806758fcc6da7d3efff5d62643/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23addcbe818d7f37babeca7e1cf3ab47f/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/282ae6a0a6a0269d66ba1aed291cb41a5/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/298a21fa4234d97bd16d046ca9dab5947/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29e4c44f56a5ea47b7e226d9bdf22016c/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2782b1dfda88ffe8db9d442d9a5816dd1/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2340ea63dd48b93b016fadb6d92a975f6/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26a5bdad797dca447e00dbdcd907fbc01/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20afc8ac9600ff851d170b1b0ebc514bc/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bc41c47234cc901548b025e1916feaaf/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2da9585fe9a9effdd6471a41fc521580e/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bcc2085e9f598929324c1580288b3c6c/smicha"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/231b316bffa8c5636de517027bc1f08ce/smicha"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/264392165113ce4f94890d21237283572/smicha"><title>Fast residual computation for sliding window recursive least squares methods</title><link>http://www.bibsonomy.org/bibtex/264392165113ce4f94890d21237283572/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>least Recursive squares </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Kyeongah &lt;a href=&#034;http://www.bibsonomy.org/author/Yoo&#034;&gt;Yoo&lt;/a&gt;  and Haesun &lt;a href=&#034;http://www.bibsonomy.org/author/Park&#034;&gt;Park&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;45(1):85--95&lt;/em&gt;&lt;em&gt;Jul1995. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Recursive"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/264392165113ce4f94890d21237283572/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/264392165113ce4f94890d21237283572/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-3YS9204-W/1/0a5f40d29c0d52fe18d3834e42f48568"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Jul</swrc:month><swrc:number>1</swrc:number><swrc:pages>85--95</swrc:pages><swrc:title>Fast residual computation for sliding window recursive least squares
	methods</swrc:title><swrc:volume>45</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>least Recursive squares </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Kyeongah Yoo"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Haesun Park"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/258efce1e4047e6e2cb333c2489a2fbf5/smicha"><title>A geometric approach of the generalized least-squares estimation in analysis of covariance structures</title><link>http://www.bibsonomy.org/bibtex/258efce1e4047e6e2cb333c2489a2fbf5/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Generalized least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;S. J. &lt;a href=&#034;http://www.bibsonomy.org/author/Wang&#034;&gt;Wang&lt;/a&gt;  and Sik-Yum &lt;a href=&#034;http://www.bibsonomy.org/author/Lee&#034;&gt;Lee&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Statistics \&amp;amp; Probability Letters&lt;/em&gt;&lt;em&gt;24(1):39--47&lt;/em&gt;&lt;em&gt;Jul1995. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Generalized"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/258efce1e4047e6e2cb333c2489a2fbf5/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/258efce1e4047e6e2cb333c2489a2fbf5/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3YCN1RF-1S/1/b76262c28093c32925194d92043f6d71"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Jul</swrc:month><swrc:number>1</swrc:number><swrc:pages>39--47</swrc:pages><swrc:title>A geometric approach of the generalized least-squares estimation
	in analysis of covariance structures</swrc:title><swrc:volume>24</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>squares Generalized least </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="S. J. Wang"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Sik-Yum Lee"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/24063681c0f21bf58ebac8885a13d75c0/smicha"><title>Prediction via estimating functions</title><link>http://www.bibsonomy.org/bibtex/24063681c0f21bf58ebac8885a13d75c0/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Minimum mean </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;A. &lt;a href=&#034;http://www.bibsonomy.org/author/Thavaneswaran&#034;&gt;Thavaneswaran&lt;/a&gt;  and C. C. &lt;a href=&#034;http://www.bibsonomy.org/author/Heyde&#034;&gt;Heyde&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Statistical Planning and Inference&lt;/em&gt;&lt;em&gt;77(1):89--101&lt;/em&gt;&lt;em&gt;Feb1999. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Minimum"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mean"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24063681c0f21bf58ebac8885a13d75c0/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24063681c0f21bf58ebac8885a13d75c0/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-3VTBF6H-6/1/1d51803c8a0ebd0538151368900ba264"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>Feb</swrc:month><swrc:number>1</swrc:number><swrc:pages>89--101</swrc:pages><swrc:title>Prediction via estimating functions</swrc:title><swrc:volume>77</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>squares Minimum mean </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="A. Thavaneswaran"/></rdf:_1><rdf:_2><swrc:Person swrc:name="C. C. Heyde"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/20822f66f6dbb93b2257e9f34b798e9f8/smicha"><title>Numerical characteristics of fast recursive least squares transversal adaptation algorithms -- A comparative study</title><link>http://www.bibsonomy.org/bibtex/20822f66f6dbb93b2257e9f34b798e9f8/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>recursive Fast least algorithm squares </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;H. &lt;a href=&#034;http://www.bibsonomy.org/author/Sch{\&amp;#034;u}tze&#034;&gt;Sch&amp;#252;tze&lt;/a&gt;  and Z. &lt;a href=&#034;http://www.bibsonomy.org/author/Ren&#034;&gt;Ren&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;27(3):317--331&lt;/em&gt;&lt;em&gt;Jun1992. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/recursive"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Fast"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20822f66f6dbb93b2257e9f34b798e9f8/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20822f66f6dbb93b2257e9f34b798e9f8/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-48TD1N9-54/1/8532bb5e6e420783dcc3f69fa71eadf5"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Jun</swrc:month><swrc:number>3</swrc:number><swrc:pages>317--331</swrc:pages><swrc:title>Numerical characteristics of fast recursive least squares transversal
	adaptation algorithms -- A comparative study</swrc:title><swrc:volume>27</swrc:volume><swrc:year>1992</swrc:year><swrc:keywords>recursive Fast least algorithm squares </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="H. Sch{\&#034;u}tze"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Z. Ren"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/26dd1eaa1dcf1bfadb89b5432832dbb8c/smicha"><title>An introduction to the Gaussian least squares approximation and its application in signal processing and system modeling</title><link>http://www.bibsonomy.org/bibtex/26dd1eaa1dcf1bfadb89b5432832dbb8c/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>approximation squares Least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Schlatter&#034;&gt;Schlatter&lt;/a&gt;  and J. &lt;a href=&#034;http://www.bibsonomy.org/author/Eichler&#034;&gt;Eichler&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;1(3):211--225&lt;/em&gt;&lt;em&gt;Jul1979. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/approximation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26dd1eaa1dcf1bfadb89b5432832dbb8c/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26dd1eaa1dcf1bfadb89b5432832dbb8c/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-48V255K-J/1/7c12d3b1062188b6f956d3c0aaada724"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Jul</swrc:month><swrc:number>3</swrc:number><swrc:pages>211--225</swrc:pages><swrc:title>An introduction to the Gaussian least squares approximation and its
	application in signal processing and system modeling</swrc:title><swrc:volume>1</swrc:volume><swrc:year>1979</swrc:year><swrc:keywords>approximation squares Least </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Schlatter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="J. Eichler"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2378605d59cb37e4f5ae277a77f46d61e/smicha"><title>Weighted least squares estimates in partly linear regression models</title><link>http://www.bibsonomy.org/bibtex/2378605d59cb37e4f5ae277a77f46d61e/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>least squares spline Weighted estimates </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Anton &lt;a href=&#034;http://www.bibsonomy.org/author/Schick&#034;&gt;Schick&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Statistics \&amp;amp; Probability Letters&lt;/em&gt;&lt;em&gt;27(3):281--287&lt;/em&gt;&lt;em&gt;Apr1996. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spline"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Weighted"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/estimates"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2378605d59cb37e4f5ae277a77f46d61e/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2378605d59cb37e4f5ae277a77f46d61e/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3VSNHG0-H/1/4578f47d69edb7d880947100d67f8a3b"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Apr</swrc:month><swrc:number>3</swrc:number><swrc:pages>281--287</swrc:pages><swrc:title>Weighted least squares estimates in partly linear regression models</swrc:title><swrc:volume>27</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>least squares spline Weighted estimates </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Anton Schick"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2520554b1b3f4586f35f202621c1e09a6/smicha"><title>A stabilized fast transversal filters algorithm for recursive least squares adaptive filtering</title><link>http://www.bibsonomy.org/bibtex/2520554b1b3f4586f35f202621c1e09a6/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares least recursive algorithm Fast </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Zhiyun &lt;a href=&#034;http://www.bibsonomy.org/author/Ren&#034;&gt;Ren&lt;/a&gt;  and Helmut &lt;a href=&#034;http://www.bibsonomy.org/author/Sch{\&amp;#034;u}tze&#034;&gt;Sch&amp;#252;tze&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;39(3):235--246&lt;/em&gt;&lt;em&gt;Sep1994. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/recursive"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Fast"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2520554b1b3f4586f35f202621c1e09a6/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2520554b1b3f4586f35f202621c1e09a6/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-48XCYN8-J6/1/d8eb4f07370c9fbce5283863def88d46"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Sep</swrc:month><swrc:number>3</swrc:number><swrc:pages>235--246</swrc:pages><swrc:title>A stabilized fast transversal filters algorithm for recursive least
	squares adaptive filtering</swrc:title><swrc:volume>39</swrc:volume><swrc:year>1994</swrc:year><swrc:keywords>squares least recursive algorithm Fast </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Zhiyun Ren"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Helmut Sch{\&#034;u}tze"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2233eab806758fcc6da7d3efff5d62643/smicha"><title>Estimation of nonlinear random coefficient models</title><link>http://www.bibsonomy.org/bibtex/2233eab806758fcc6da7d3efff5d62643/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>least Generalized squares </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Rogelio Q. &lt;a href=&#034;http://www.bibsonomy.org/author/Ramos&#034;&gt;Ramos&lt;/a&gt;  and Sastry G. &lt;a href=&#034;http://www.bibsonomy.org/author/Pantula&#034;&gt;Pantula&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Statistics \&amp;amp; Probability Letters&lt;/em&gt;&lt;em&gt;24(1):49--56&lt;/em&gt;&lt;em&gt;Jul1995. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Generalized"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2233eab806758fcc6da7d3efff5d62643/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2233eab806758fcc6da7d3efff5d62643/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3YCN1RF-1T/1/d489320111670a1a46e87682a3253b7a"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Jul</swrc:month><swrc:number>1</swrc:number><swrc:pages>49--56</swrc:pages><swrc:title>Estimation of nonlinear random coefficient models</swrc:title><swrc:volume>24</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>least Generalized squares </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rogelio Q. Ramos"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Sastry G. Pantula"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/23addcbe818d7f37babeca7e1cf3ab47f/smicha"><title>A unified and efficient least-squares design of linear-phase nonrecursive filters</title><link>http://www.bibsonomy.org/bibtex/23addcbe818d7f37babeca7e1cf3ab47f/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ravi P. &lt;a href=&#034;http://www.bibsonomy.org/author/Ramachandran&#034;&gt;Ramachandran&lt;/a&gt;  and S. &lt;a href=&#034;http://www.bibsonomy.org/author/Sunder&#034;&gt;Sunder&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;36(1):41--53&lt;/em&gt;&lt;em&gt;Mar1994. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23addcbe818d7f37babeca7e1cf3ab47f/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23addcbe818d7f37babeca7e1cf3ab47f/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-48XCYCM-FB/1/8d99494276dc4d2eba5645ddea15b43f"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Mar</swrc:month><swrc:number>1</swrc:number><swrc:pages>41--53</swrc:pages><swrc:title>A unified and efficient least-squares design of linear-phase nonrecursive
	filters</swrc:title><swrc:volume>36</swrc:volume><swrc:year>1994</swrc:year><swrc:keywords>squares Least </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ravi P. Ramachandran"/></rdf:_1><rdf:_2><swrc:Person swrc:name="S. Sunder"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/282ae6a0a6a0269d66ba1aed291cb41a5/smicha"><title>Overview of total least-squares methods</title><link>http://www.bibsonomy.org/bibtex/282ae6a0a6a0269d66ba1aed291cb41a5/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>Total squares least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ivan &lt;a href=&#034;http://www.bibsonomy.org/author/Markovsky&#034;&gt;Markovsky&lt;/a&gt;  and Sabine Van &lt;a href=&#034;http://www.bibsonomy.org/author/Huffel&#034;&gt;Huffel&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;87(10):2283--2302&lt;/em&gt;&lt;em&gt;Oct2007. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Total"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/282ae6a0a6a0269d66ba1aed291cb41a5/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/282ae6a0a6a0269d66ba1aed291cb41a5/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-4NGRRR1-2/1/d82f3b7f78d329c0b72e2dcb71bbeb72"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Oct</swrc:month><swrc:number>10</swrc:number><swrc:pages>2283--2302</swrc:pages><swrc:title>Overview of total least-squares methods</swrc:title><swrc:volume>87</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>Total squares least </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ivan Markovsky"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Sabine Van Huffel"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/298a21fa4234d97bd16d046ca9dab5947/smicha"><title>IQML-like algorithms for solving structured total least squares problems: a unified view</title><link>http://www.bibsonomy.org/bibtex/298a21fa4234d97bd16d046ca9dab5947/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>least Structured total squares </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Philippe &lt;a href=&#034;http://www.bibsonomy.org/author/Lemmerling&#034;&gt;Lemmerling&lt;/a&gt;  and Leentje &lt;a href=&#034;http://www.bibsonomy.org/author/Vanhamme&#034;&gt;Vanhamme&lt;/a&gt;  and Sabine Van &lt;a href=&#034;http://www.bibsonomy.org/author/Huffel&#034;&gt;Huffel&lt;/a&gt;  and Bart De &lt;a href=&#034;http://www.bibsonomy.org/author/Moor&#034;&gt;Moor&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;81(9):1935--1945&lt;/em&gt;&lt;em&gt;Sep2001. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Structured"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/total"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/298a21fa4234d97bd16d046ca9dab5947/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/298a21fa4234d97bd16d046ca9dab5947/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-43MMVPN-D/1/05e7e93aca78bd61abbaa2e2116c23c9"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Sep</swrc:month><swrc:number>9</swrc:number><swrc:pages>1935--1945</swrc:pages><swrc:title>IQML-like algorithms for solving structured total least squares problems:
	a unified view</swrc:title><swrc:volume>81</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>least Structured total squares </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Philippe Lemmerling"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Leentje Vanhamme"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Sabine Van Huffel"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Bart De Moor"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/29e4c44f56a5ea47b7e226d9bdf22016c/smicha"><title>Relative efficiency of three estimators in a polynomial regression with measurement errors</title><link>http://www.bibsonomy.org/bibtex/29e4c44f56a5ea47b7e226d9bdf22016c/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>Adjusted squares least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Alexander &lt;a href=&#034;http://www.bibsonomy.org/author/Kukush&#034;&gt;Kukush&lt;/a&gt;  and Hans &lt;a href=&#034;http://www.bibsonomy.org/author/Schneeweiss&#034;&gt;Schneeweiss&lt;/a&gt;  and Roland &lt;a href=&#034;http://www.bibsonomy.org/author/Wolf&#034;&gt;Wolf&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Statistical Planning and Inference&lt;/em&gt;&lt;em&gt;127(1-2):179--203&lt;/em&gt;&lt;em&gt;Jan2005. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Adjusted"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/29e4c44f56a5ea47b7e226d9bdf22016c/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29e4c44f56a5ea47b7e226d9bdf22016c/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-49W62T8-1/1/94c37de8a25003c16ebfa4bf664b1ba1"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>Jan</swrc:month><swrc:number>1-2</swrc:number><swrc:pages>179--203</swrc:pages><swrc:title>Relative efficiency of three estimators in a polynomial regression
	with measurement errors</swrc:title><swrc:volume>127</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>Adjusted squares least </swrc:keywords><swrc:day>01</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Alexander Kukush"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Hans Schneeweiss"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Roland Wolf"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2782b1dfda88ffe8db9d442d9a5816dd1/smicha"><title>Nonparametric estimation of piecewise smooth regression functions</title><link>http://www.bibsonomy.org/bibtex/2782b1dfda88ffe8db9d442d9a5816dd1/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Michael &lt;a href=&#034;http://www.bibsonomy.org/author/Kohler&#034;&gt;Kohler&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Statistics \&amp;amp; Probability Letters&lt;/em&gt;&lt;em&gt;43(1):49--55&lt;/em&gt;&lt;em&gt;May1999. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2782b1dfda88ffe8db9d442d9a5816dd1/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2782b1dfda88ffe8db9d442d9a5816dd1/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3W48HPM-7/1/9fc8b40371b1e457cb7530508e15362b"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>May</swrc:month><swrc:number>1</swrc:number><swrc:pages>49--55</swrc:pages><swrc:title>Nonparametric estimation of piecewise smooth regression functions</swrc:title><swrc:volume>43</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>squares Least </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael Kohler"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2340ea63dd48b93b016fadb6d92a975f6/smicha"><title>Optimal estimation of line segments in noisy lidar data</title><link>http://www.bibsonomy.org/bibtex/2340ea63dd48b93b016fadb6d92a975f6/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Kapp&#034;&gt;Kapp&lt;/a&gt;  and Lutz &lt;a href=&#034;http://www.bibsonomy.org/author/Gr{\&amp;#034;o}ll&#034;&gt;Gr&amp;#246;ll&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;86(9):2304--2317&lt;/em&gt;&lt;em&gt;Sep2006. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2340ea63dd48b93b016fadb6d92a975f6/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2340ea63dd48b93b016fadb6d92a975f6/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-4HRDX9C-1/1/991019a51eac6f84555ad161bdbdbe9a"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Sep</swrc:month><swrc:number>9</swrc:number><swrc:pages>2304--2317</swrc:pages><swrc:title>Optimal estimation of line segments in noisy lidar data</swrc:title><swrc:volume>86</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>squares Least </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andreas Kapp"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Lutz Gr{\&#034;o}ll"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/26a5bdad797dca447e00dbdcd907fbc01/smicha"><title>Mutually orthogonal latin squares: a brief survey of constructions</title><link>http://www.bibsonomy.org/bibtex/26a5bdad797dca447e00dbdcd907fbc01/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares orthogonal latin Mutually </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Charles J. &lt;a href=&#034;http://www.bibsonomy.org/author/Colbourn&#034;&gt;Colbourn&lt;/a&gt;  and Jeffrey H. &lt;a href=&#034;http://www.bibsonomy.org/author/Dinitz&#034;&gt;Dinitz&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Statistical Planning and Inference&lt;/em&gt;&lt;em&gt;95(1-2):9--48&lt;/em&gt;&lt;em&gt;May2001. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/orthogonal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/latin"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Mutually"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26a5bdad797dca447e00dbdcd907fbc01/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26a5bdad797dca447e00dbdcd907fbc01/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-42M1G3X-3/1/ec4043fe479b920bd3a228c611a9a4b8"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>May</swrc:month><swrc:number>1-2</swrc:number><swrc:pages>9--48</swrc:pages><swrc:title>Mutually orthogonal latin squares: a brief survey of constructions</swrc:title><swrc:volume>95</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>squares orthogonal latin Mutually </swrc:keywords><swrc:day>01</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Charles J. Colbourn"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Jeffrey H. Dinitz"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/20afc8ac9600ff851d170b1b0ebc514bc/smicha"><title>Estimation of regression parameters with left truncated data</title><link>http://www.bibsonomy.org/bibtex/20afc8ac9600ff851d170b1b0ebc514bc/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>least Weighted squares </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Shuyuan &lt;a href=&#034;http://www.bibsonomy.org/author/He&#034;&gt;He&lt;/a&gt;  and Grace L. &lt;a href=&#034;http://www.bibsonomy.org/author/Yang&#034;&gt;Yang&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Statistical Planning and Inference&lt;/em&gt;&lt;em&gt;117(1):99--122&lt;/em&gt;&lt;em&gt;Nov2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Weighted"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20afc8ac9600ff851d170b1b0ebc514bc/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20afc8ac9600ff851d170b1b0ebc514bc/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-472JW2H-1T/1/0d5b01141f99524016d173b2ae95efa3"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>Nov</swrc:month><swrc:number>1</swrc:number><swrc:pages>99--122</swrc:pages><swrc:title>Estimation of regression parameters with left truncated data</swrc:title><swrc:volume>117</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>least Weighted squares </swrc:keywords><swrc:day>01</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shuyuan He"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Grace L. Yang"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2bc41c47234cc901548b025e1916feaaf/smicha"><title>Restricted ridge estimation</title><link>http://www.bibsonomy.org/bibtex/2bc41c47234cc901548b025e1916feaaf/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;J&amp;#252;rgen &lt;a href=&#034;http://www.bibsonomy.org/author/Gro{\ss}&#034;&gt;Gross&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Statistics \&amp;amp; Probability Letters&lt;/em&gt;&lt;em&gt;65(1):57--64&lt;/em&gt;&lt;em&gt;Oct2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bc41c47234cc901548b025e1916feaaf/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bc41c47234cc901548b025e1916feaaf/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-49D6S6W-1/1/1461a7cabfc4b34d0d057ff38d68d737"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Oct</swrc:month><swrc:number>1</swrc:number><swrc:pages>57--64</swrc:pages><swrc:title>Restricted ridge estimation</swrc:title><swrc:volume>65</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>squares Least </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J{\&#034;u}rgen Gro{\ss}"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2da9585fe9a9effdd6471a41fc521580e/smicha"><title>A fast algorithm for -1 factorization of Toeplitz matrices</title><link>http://www.bibsonomy.org/bibtex/2da9585fe9a9effdd6471a41fc521580e/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares estimation Least </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;George-Othon &lt;a href=&#034;http://www.bibsonomy.org/author/Glentis&#034;&gt;Glentis&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;42(1):19--36&lt;/em&gt;&lt;em&gt;Feb1995. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/estimation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Least"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2da9585fe9a9effdd6471a41fc521580e/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2da9585fe9a9effdd6471a41fc521580e/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-3YS8MMF-N/1/7d226f987de3620207b50c3fed2d1fe5"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Feb</swrc:month><swrc:number>1</swrc:number><swrc:pages>19--36</swrc:pages><swrc:title>A fast algorithm for -1 factorization of Toeplitz matrices</swrc:title><swrc:volume>42</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>squares estimation Least </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="George-Othon Glentis"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2bcc2085e9f598929324c1580288b3c6c/smicha"><title>The minimum size of critical sets in latin squares</title><link>http://www.bibsonomy.org/bibtex/2bcc2085e9f598929324c1580288b3c6c/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares Latin </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Chin-Mei &lt;a href=&#034;http://www.bibsonomy.org/author/Fu&#034;&gt;Fu&lt;/a&gt;  and Hung-Lin &lt;a href=&#034;http://www.bibsonomy.org/author/Fu&#034;&gt;Fu&lt;/a&gt;  and C. A. &lt;a href=&#034;http://www.bibsonomy.org/author/Rodger&#034;&gt;Rodger&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Statistical Planning and Inference&lt;/em&gt;&lt;em&gt;62(2):333--337&lt;/em&gt;&lt;em&gt;Aug1997. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Latin"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bcc2085e9f598929324c1580288b3c6c/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bcc2085e9f598929324c1580288b3c6c/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-3SP2B0R-F/1/3bdc2483f98b0ebf435621b25ad80d8f"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>Aug</swrc:month><swrc:number>2</swrc:number><swrc:pages>333--337</swrc:pages><swrc:title>The minimum size of critical sets in latin squares</swrc:title><swrc:volume>62</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>squares Latin </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Chin-Mei Fu"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Hung-Lin Fu"/></rdf:_2><rdf:_3><swrc:Person swrc:name="C. A. Rodger"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/231b316bffa8c5636de517027bc1f08ce/smicha"><title>Recursive total instrumental-variable algorithm for solving over-determined normal equations and its applications</title><link>http://www.bibsonomy.org/bibtex/231b316bffa8c5636de517027bc1f08ce/smicha</link><dc:creator>smicha</dc:creator><dc:date>2008-04-23T22:05:04+02:00</dc:date><dc:subject>squares least Recursive </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Da-Zheng &lt;a href=&#034;http://www.bibsonomy.org/author/Feng&#034;&gt;Feng&lt;/a&gt;  and Wei Xing &lt;a href=&#034;http://www.bibsonomy.org/author/Zheng&#034;&gt;Zheng&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Signal Processing&lt;/em&gt;&lt;em&gt;87(5):918--936&lt;/em&gt;&lt;em&gt;May2007. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/squares"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/least"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Recursive"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/231b316bffa8c5636de517027bc1f08ce/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/231b316bffa8c5636de517027bc1f08ce/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-4M9HWY5-1/1/6d1424dbc2dfb8c8e79b67b408fe2550"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>May</swrc:month><swrc:number>5</swrc:number><swrc:pages>918--936</swrc:pages><swrc:title>Recursive total instrumental-variable algorithm for solving over-determined
	normal equations and its applications</swrc:title><swrc:volume>87</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>squares least Recursive </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Da-Zheng Feng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Wei Xing Zheng"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>