[{"citation":{"chicago":"Karl, Holger, and Seble Mengesha. “Analysing Capacity Improvements in Wireless Networks by Relaying.” In <i>Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks</i>, 339--348, 2001.","short":"H. Karl, S. Mengesha, in: Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks, 2001, pp. 339--348.","ieee":"H. Karl and S. Mengesha, “Analysing capacity improvements in wireless networks by relaying,” in <i>Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks</i>, 2001, pp. 339--348.","apa":"Karl, H., &#38; Mengesha, S. (2001). Analysing capacity improvements in wireless networks by relaying. In <i>Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks</i> (pp. 339--348).","bibtex":"@inproceedings{Karl_Mengesha_2001, title={Analysing capacity improvements in wireless networks by relaying}, booktitle={Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks}, author={Karl, Holger and Mengesha, Seble}, year={2001}, pages={339--348} }","ama":"Karl H, Mengesha S. Analysing capacity improvements in wireless networks by relaying. In: <i>Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks</i>. ; 2001:339--348.","mla":"Karl, Holger, and Seble Mengesha. “Analysing Capacity Improvements in Wireless Networks by Relaying.” <i>Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks</i>, 2001, pp. 339--348."},"publication":"Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks","department":[{"_id":"75"}],"type":"conference","date_created":"2017-11-27T10:22:29Z","date_updated":"2019-01-03T13:18:56Z","author":[{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"},{"full_name":"Mengesha, Seble","first_name":"Seble","last_name":"Mengesha"}],"year":"2001","status":"public","title":"Analysing capacity improvements in wireless networks by relaying","user_id":"15572","_id":"995","page":"339--348"},{"user_id":"15572","_id":"996","date_updated":"2019-01-03T13:18:56Z","title":"Relative jitter packet scheduling for differentiated services","year":"2001","status":"public","author":[{"full_name":"Quynh, T","last_name":"Quynh","first_name":"T"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"},{"full_name":"Wolisz, Adam","first_name":"Adam","last_name":"Wolisz"},{"full_name":"Rebensburg, Klaus","first_name":"Klaus","last_name":"Rebensburg"}],"type":"conference","department":[{"_id":"75"}],"date_created":"2017-11-27T10:22:29Z","publication":"Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM & IP Networks","citation":{"mla":"Quynh, T., et al. “Relative Jitter Packet Scheduling for Differentiated Services.” <i>Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks</i>, 2001.","ama":"Quynh T, Karl H, Wolisz A, Rebensburg K. Relative jitter packet scheduling for differentiated services. In: <i>Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks</i>. ; 2001.","bibtex":"@inproceedings{Quynh_Karl_Wolisz_Rebensburg_2001, title={Relative jitter packet scheduling for differentiated services}, booktitle={Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks}, author={Quynh, T and Karl, Holger and Wolisz, Adam and Rebensburg, Klaus}, year={2001} }","apa":"Quynh, T., Karl, H., Wolisz, A., &#38; Rebensburg, K. (2001). Relative jitter packet scheduling for differentiated services. In <i>Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks</i>.","ieee":"T. Quynh, H. Karl, A. Wolisz, and K. Rebensburg, “Relative jitter packet scheduling for differentiated services,” in <i>Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks</i>, 2001.","short":"T. Quynh, H. Karl, A. Wolisz, K. Rebensburg, in: Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks, 2001.","chicago":"Quynh, T, Holger Karl, Adam Wolisz, and Klaus Rebensburg. “Relative Jitter Packet Scheduling for Differentiated Services.” In <i>Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM &#38; IP Networks</i>, 2001."}},{"author":[{"last_name":"Clark","first_name":"Damon","full_name":"Clark, Damon"},{"last_name":"Fahr","first_name":"Rene","full_name":"Fahr, Rene","id":"111"}],"status":"public","year":"2001","title":"The promise of workplace training for non-college-bound youth: Theory and evidence from German apprenticeship","intvolume":"       528","date_updated":"2022-01-06T07:01:38Z","publisher":"London School of Economics","_id":"5105","language":[{"iso":"eng"}],"volume":528,"user_id":"69384","citation":{"chicago":"Clark, Damon, and Rene Fahr. “The Promise of Workplace Training for Non-College-Bound Youth: Theory and Evidence from German Apprenticeship.” <i>CEP Discussion Paper No. 528</i> 528 (2001).","short":"D. Clark, R. Fahr, CEP Discussion Paper No. 528 528 (2001).","apa":"Clark, D., &#38; Fahr, R. (2001). The promise of workplace training for non-college-bound youth: Theory and evidence from German apprenticeship. <i>CEP Discussion Paper No. 528</i>, <i>528</i>.","ieee":"D. Clark and R. Fahr, “The promise of workplace training for non-college-bound youth: Theory and evidence from German apprenticeship,” <i>CEP Discussion Paper No. 528</i>, vol. 528, 2001.","ama":"Clark D, Fahr R. The promise of workplace training for non-college-bound youth: Theory and evidence from German apprenticeship. <i>CEP Discussion Paper No 528</i>. 2001;528.","bibtex":"@article{Clark_Fahr_2001, title={The promise of workplace training for non-college-bound youth: Theory and evidence from German apprenticeship}, volume={528}, journal={CEP Discussion Paper No. 528}, publisher={London School of Economics}, author={Clark, Damon and Fahr, Rene}, year={2001} }","mla":"Clark, Damon, and Rene Fahr. “The Promise of Workplace Training for Non-College-Bound Youth: Theory and Evidence from German Apprenticeship.” <i>CEP Discussion Paper No. 528</i>, vol. 528, London School of Economics, 2001."},"publication":"CEP Discussion Paper No. 528","date_created":"2018-10-31T07:25:39Z","department":[{"_id":"178"},{"_id":"179"}],"type":"journal_article"},{"citation":{"apa":"Schryen, G. (2001). <i>Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption eines Vorgehensmodells zur Einführung und Etablierung</i>. Wiesbaden: Deutscher Universitäts-Verlag.","ieee":"G. Schryen, <i>Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption eines Vorgehensmodells zur Einführung und Etablierung</i>. Wiesbaden: Deutscher Universitäts-Verlag, 2001.","chicago":"Schryen, Guido. <i>Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption Eines Vorgehensmodells Zur Einführung Und Etablierung</i>. Wiesbaden: Deutscher Universitäts-Verlag, 2001.","short":"G. Schryen, Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption Eines Vorgehensmodells Zur Einführung Und Etablierung, Deutscher Universitäts-Verlag, Wiesbaden, 2001.","mla":"Schryen, Guido. <i>Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption Eines Vorgehensmodells Zur Einführung Und Etablierung</i>. Deutscher Universitäts-Verlag, 2001.","ama":"Schryen G. <i>Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption Eines Vorgehensmodells Zur Einführung Und Etablierung</i>. Wiesbaden: Deutscher Universitäts-Verlag; 2001.","bibtex":"@book{Schryen_2001, place={Wiesbaden}, title={Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption eines Vorgehensmodells zur Einführung und Etablierung}, publisher={Deutscher Universitäts-Verlag}, author={Schryen, Guido}, year={2001} }"},"extern":"1","date_created":"2018-11-14T15:05:01Z","place":"Wiesbaden","type":"book","department":[{"_id":"277"}],"year":"2001","status":"public","title":"Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption eines Vorgehensmodells zur Einführung und Etablierung","author":[{"id":"72850","last_name":"Schryen","first_name":"Guido","full_name":"Schryen, Guido"}],"date_updated":"2022-01-06T07:02:26Z","_id":"5670","publisher":"Deutscher Universitäts-Verlag","language":[{"iso":"eng"}],"user_id":"61579"},{"place":"Stuttgart","date_created":"2019-01-16T09:39:14Z","department":[{"_id":"36"},{"_id":"1"},{"_id":"380"}],"type":"book_editor","citation":{"mla":"Tönnies, Merle, and Claus-Ulrich Viol, editors. <i>British Political Speeches from Churchill to Blair</i>. Reclam, 2001.","bibtex":"@book{Tönnies_Viol_2001, place={Stuttgart}, title={British Political Speeches from Churchill to Blair}, publisher={Reclam}, year={2001} }","ama":"Tönnies M, Viol C-U, eds. <i>British Political Speeches from Churchill to Blair</i>. Stuttgart: Reclam; 2001.","ieee":"M. Tönnies and C.-U. Viol, Eds., <i>British Political Speeches from Churchill to Blair</i>. Stuttgart: Reclam, 2001.","apa":"Tönnies, M., &#38; Viol, C.-U. (Eds.). (2001). <i>British Political Speeches from Churchill to Blair</i>. Stuttgart: Reclam.","short":"M. Tönnies, C.-U. Viol, eds., British Political Speeches from Churchill to Blair, Reclam, Stuttgart, 2001.","chicago":"Tönnies, Merle, and Claus-Ulrich Viol, eds. <i>British Political Speeches from Churchill to Blair</i>. Stuttgart: Reclam, 2001."},"publisher":"Reclam","_id":"6760","language":[{"iso":"eng"}],"editor":[{"id":"555","full_name":"Tönnies, Merle","last_name":"Tönnies","first_name":"Merle"},{"full_name":"Viol, Claus-Ulrich","first_name":"Claus-Ulrich","last_name":"Viol"}],"user_id":"32277","year":"2001","title":"British Political Speeches from Churchill to Blair","status":"public","date_updated":"2022-01-06T07:03:17Z","publication_status":"published"},{"abstract":[{"text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.","lang":"eng"}],"citation":{"short":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.","chicago":"Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>.","ieee":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>, 2001.","apa":"Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &#38; Straßer, W. (2001). The randomized z-buffer algorithm. In <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>","bibtex":"@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The randomized z-buffer algorithm}, DOI={<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>}, booktitle={Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001} }","ama":"Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>. ; 2001. doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>","mla":"Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001, doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>."},"publication":"Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH '01","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-09T10:36:54Z","date_updated":"2022-01-06T06:52:51Z","publication_status":"published","author":[{"full_name":"Wand, Michael","first_name":"Michael","last_name":"Wand"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Peter, Ingmar","first_name":"Ingmar","last_name":"Peter"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Straßer, Wolfgang","last_name":"Straßer","first_name":"Wolfgang"}],"publication_identifier":{"isbn":["158113374X"]},"status":"public","year":"2001","title":"The randomized z-buffer algorithm","doi":"10.1145/383259.383299","user_id":"15415","language":[{"iso":"eng"}],"_id":"16492"},{"_id":"16493","series_title":" Lecture Notes in Computer Science","language":[{"iso":"eng"}],"volume":2204,"doi":"10.1007/3-540-45477-2_2","user_id":"15415","publication_identifier":{"isbn":["9783540427070","9783540454779"],"issn":["0302-9743"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"year":"2001","status":"public","title":"Data Management in Networks","intvolume":"      2204","date_updated":"2022-01-06T06:52:51Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-09T10:40:48Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"apa":"Meyer auf der Heide, F. (2001). Data Management in Networks. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 2204). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>","ieee":"F. Meyer auf der Heide, “Data Management in Networks,” in <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In <i>Graph-Theoretic Concepts in Computer Science</i>, Vol. 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>.","short":"F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.","mla":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>.","ama":"Meyer auf der Heide F. Data Management in Networks. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>","bibtex":"@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204}, DOI={<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science} }"},"publication":"Graph-Theoretic Concepts in Computer Science"},{"language":[{"iso":"eng"}],"_id":"16494","user_id":"15415","doi":"10.1007/3-540-45718-6_68","year":"2001","title":"Parallel Bridging Models and Their Impact on Algorithm Design","status":"public","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422334","9783540457183"]},"publication_status":"published","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:51:36Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Computational Science - ICCS 2001","citation":{"apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>","ieee":"F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in <i>Computational Science - ICCS 2001</i>, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>.","short":"F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” <i>Computational Science - ICCS 2001</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>.","ama":"Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>","bibtex":"@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel Bridging Models and Their Impact on Algorithm Design}, DOI={<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>}, booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2001} }"}},{"type":"book_chapter","department":[{"_id":"101"}],"date_created":"2020-04-15T09:10:54Z","place":"Berlin, Heidelberg","publication":"Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems","citation":{"apa":"Dellnitz, M., Froyland, G., &#38; Junge, O. (2001). The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems. In <i>Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-56589-2_7\">https://doi.org/10.1007/978-3-642-56589-2_7</a>","ieee":"M. Dellnitz, G. Froyland, and O. Junge, “The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems,” in <i>Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems</i>, Berlin, Heidelberg, 2001.","chicago":"Dellnitz, Michael, Gary Froyland, and Oliver Junge. “The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems.” In <i>Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems</i>. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/978-3-642-56589-2_7\">https://doi.org/10.1007/978-3-642-56589-2_7</a>.","short":"M. Dellnitz, G. Froyland, O. Junge, in: Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems, Berlin, Heidelberg, 2001.","mla":"Dellnitz, Michael, et al. “The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems.” <i>Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems</i>, 2001, doi:<a href=\"https://doi.org/10.1007/978-3-642-56589-2_7\">10.1007/978-3-642-56589-2_7</a>.","ama":"Dellnitz M, Froyland G, Junge O. The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems. In: <i>Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems</i>. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/978-3-642-56589-2_7\">10.1007/978-3-642-56589-2_7</a>","bibtex":"@inbook{Dellnitz_Froyland_Junge_2001, place={Berlin, Heidelberg}, title={The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-56589-2_7\">10.1007/978-3-642-56589-2_7</a>}, booktitle={Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems}, author={Dellnitz, Michael and Froyland, Gary and Junge, Oliver}, year={2001} }"},"user_id":"15701","doi":"10.1007/978-3-642-56589-2_7","language":[{"iso":"eng"}],"_id":"16555","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","title":"The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems","year":"2001","status":"public","publication_identifier":{"isbn":["9783642625244","9783642565892"]},"author":[{"last_name":"Dellnitz","first_name":"Michael","full_name":"Dellnitz, Michael"},{"full_name":"Froyland, Gary","last_name":"Froyland","first_name":"Gary"},{"full_name":"Junge, Oliver","last_name":"Junge","first_name":"Oliver"}]},{"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","title":"Extracting Dynamical Behavior via Markov Models","year":"2001","status":"public","publication_identifier":{"isbn":["9781461266488","9781461201779"]},"author":[{"last_name":"Froyland","first_name":"Gary","full_name":"Froyland, Gary"}],"user_id":"15701","doi":"10.1007/978-1-4612-0177-9_12","_id":"16598","language":[{"iso":"eng"}],"publication":"Nonlinear Dynamics and Statistics","citation":{"chicago":"Froyland, Gary. “Extracting Dynamical Behavior via Markov Models.” In <i>Nonlinear Dynamics and Statistics</i>. Boston, MA, 2001. <a href=\"https://doi.org/10.1007/978-1-4612-0177-9_12\">https://doi.org/10.1007/978-1-4612-0177-9_12</a>.","short":"G. Froyland, in: Nonlinear Dynamics and Statistics, Boston, MA, 2001.","apa":"Froyland, G. (2001). Extracting Dynamical Behavior via Markov Models. In <i>Nonlinear Dynamics and Statistics</i>. Boston, MA. <a href=\"https://doi.org/10.1007/978-1-4612-0177-9_12\">https://doi.org/10.1007/978-1-4612-0177-9_12</a>","ieee":"G. Froyland, “Extracting Dynamical Behavior via Markov Models,” in <i>Nonlinear Dynamics and Statistics</i>, Boston, MA, 2001.","ama":"Froyland G. Extracting Dynamical Behavior via Markov Models. In: <i>Nonlinear Dynamics and Statistics</i>. Boston, MA; 2001. doi:<a href=\"https://doi.org/10.1007/978-1-4612-0177-9_12\">10.1007/978-1-4612-0177-9_12</a>","bibtex":"@inbook{Froyland_2001, place={Boston, MA}, title={Extracting Dynamical Behavior via Markov Models}, DOI={<a href=\"https://doi.org/10.1007/978-1-4612-0177-9_12\">10.1007/978-1-4612-0177-9_12</a>}, booktitle={Nonlinear Dynamics and Statistics}, author={Froyland, Gary}, year={2001} }","mla":"Froyland, Gary. “Extracting Dynamical Behavior via Markov Models.” <i>Nonlinear Dynamics and Statistics</i>, 2001, doi:<a href=\"https://doi.org/10.1007/978-1-4612-0177-9_12\">10.1007/978-1-4612-0177-9_12</a>."},"type":"book_chapter","department":[{"_id":"101"}],"date_created":"2020-04-16T06:03:45Z","place":"Boston, MA"},{"_id":"16601","language":[{"iso":"eng"}],"page":"68-84","doi":"10.1016/s0167-2789(01)00216-0","user_id":"15701","publication_identifier":{"issn":["0167-2789"]},"author":[{"last_name":"Froyland","first_name":"Gary","full_name":"Froyland, Gary"},{"first_name":"Oliver","last_name":"Junge","full_name":"Junge, Oliver"},{"full_name":"Ochs, Gunter","last_name":"Ochs","first_name":"Gunter"}],"title":"Rigorous computation of topological entropy with respect to a finite partition","status":"public","year":"2001","date_updated":"2022-01-06T06:52:53Z","publication_status":"published","date_created":"2020-04-16T06:08:12Z","department":[{"_id":"101"}],"type":"journal_article","citation":{"short":"G. Froyland, O. Junge, G. Ochs, Physica D: Nonlinear Phenomena (2001) 68–84.","chicago":"Froyland, Gary, Oliver Junge, and Gunter Ochs. “Rigorous Computation of Topological Entropy with Respect to a Finite Partition.” <i>Physica D: Nonlinear Phenomena</i>, 2001, 68–84. <a href=\"https://doi.org/10.1016/s0167-2789(01)00216-0\">https://doi.org/10.1016/s0167-2789(01)00216-0</a>.","apa":"Froyland, G., Junge, O., &#38; Ochs, G. (2001). Rigorous computation of topological entropy with respect to a finite partition. <i>Physica D: Nonlinear Phenomena</i>, 68–84. <a href=\"https://doi.org/10.1016/s0167-2789(01)00216-0\">https://doi.org/10.1016/s0167-2789(01)00216-0</a>","ieee":"G. Froyland, O. Junge, and G. Ochs, “Rigorous computation of topological entropy with respect to a finite partition,” <i>Physica D: Nonlinear Phenomena</i>, pp. 68–84, 2001.","ama":"Froyland G, Junge O, Ochs G. Rigorous computation of topological entropy with respect to a finite partition. <i>Physica D: Nonlinear Phenomena</i>. 2001:68-84. doi:<a href=\"https://doi.org/10.1016/s0167-2789(01)00216-0\">10.1016/s0167-2789(01)00216-0</a>","bibtex":"@article{Froyland_Junge_Ochs_2001, title={Rigorous computation of topological entropy with respect to a finite partition}, DOI={<a href=\"https://doi.org/10.1016/s0167-2789(01)00216-0\">10.1016/s0167-2789(01)00216-0</a>}, journal={Physica D: Nonlinear Phenomena}, author={Froyland, Gary and Junge, Oliver and Ochs, Gunter}, year={2001}, pages={68–84} }","mla":"Froyland, Gary, et al. “Rigorous Computation of Topological Entropy with Respect to a Finite Partition.” <i>Physica D: Nonlinear Phenomena</i>, 2001, pp. 68–84, doi:<a href=\"https://doi.org/10.1016/s0167-2789(01)00216-0\">10.1016/s0167-2789(01)00216-0</a>."},"publication":"Physica D: Nonlinear Phenomena"},{"citation":{"apa":"Junge, O. (2001). An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence. <i>Dynamical Systems</i>, 213–222. <a href=\"https://doi.org/10.1080/14689360109696233\">https://doi.org/10.1080/14689360109696233</a>","ieee":"O. Junge, “An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence,” <i>Dynamical Systems</i>, pp. 213–222, 2001.","chicago":"Junge, Oliver. “An Adaptive Subdivision Technique for the Approximation of Attractors and Invariant Measures: Proof of Convergence.” <i>Dynamical Systems</i>, 2001, 213–22. <a href=\"https://doi.org/10.1080/14689360109696233\">https://doi.org/10.1080/14689360109696233</a>.","short":"O. Junge, Dynamical Systems (2001) 213–222.","mla":"Junge, Oliver. “An Adaptive Subdivision Technique for the Approximation of Attractors and Invariant Measures: Proof of Convergence.” <i>Dynamical Systems</i>, 2001, pp. 213–22, doi:<a href=\"https://doi.org/10.1080/14689360109696233\">10.1080/14689360109696233</a>.","ama":"Junge O. An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence. <i>Dynamical Systems</i>. 2001:213-222. doi:<a href=\"https://doi.org/10.1080/14689360109696233\">10.1080/14689360109696233</a>","bibtex":"@article{Junge_2001, title={An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence}, DOI={<a href=\"https://doi.org/10.1080/14689360109696233\">10.1080/14689360109696233</a>}, journal={Dynamical Systems}, author={Junge, Oliver}, year={2001}, pages={213–222} }"},"publication":"Dynamical Systems","department":[{"_id":"101"}],"type":"journal_article","date_created":"2020-04-16T08:09:10Z","date_updated":"2022-01-06T06:52:53Z","publication_status":"published","publication_identifier":{"issn":["1468-9367","1468-9375"]},"author":[{"first_name":"Oliver","last_name":"Junge","full_name":"Junge, Oliver"}],"title":"An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence","status":"public","year":"2001","doi":"10.1080/14689360109696233","user_id":"15701","language":[{"iso":"eng"}],"_id":"16617","page":"213-222"},{"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","title":"Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark","status":"public","year":"2001","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424932","9783540446767"]},"user_id":"15415","doi":"10.1007/3-540-44676-1","editor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"language":[{"iso":"eng"}],"_id":"16722","edition":"Lecture Notes in Computer Science (LNCS, volume 2161)","publisher":"Springer ","citation":{"chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>.","short":"F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.","apa":"Meyer auf der Heide, F. (Ed.). (2001). <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i> (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>","ieee":"F. Meyer auf der Heide, Ed., <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.","ama":"Meyer auf der Heide F, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>","bibtex":"@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>}, publisher={Springer }, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, editor. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>."},"type":"book_editor","department":[{"_id":"63"}],"date_created":"2020-04-17T10:59:08Z","place":"Berlin, Heidelberg"},{"status":"public","year":"2001","title":"Glimpses into the Future of Computer Science Education","author":[{"full_name":"Domik, Gitta","first_name":"Gitta","last_name":"Domik","id":"90"}],"date_updated":"2022-01-06T06:52:56Z","intvolume":"         7","page":"366-378","language":[{"iso":"eng"}],"_id":"16811","doi":"10.3217/jucs-007-05-0366","user_id":"14955","volume":7,"publication":"J. (UCS)","issue":"5","citation":{"ieee":"G. Domik, “Glimpses into the Future of Computer Science Education,” <i>J. (UCS)</i>, vol. 7, no. 5, pp. 366–378, 2001.","apa":"Domik, G. (2001). Glimpses into the Future of Computer Science Education. <i>J. (UCS)</i>, <i>7</i>(5), 366–378. <a href=\"https://doi.org/10.3217/jucs-007-05-0366\">https://doi.org/10.3217/jucs-007-05-0366</a>","short":"G. Domik, J. (UCS) 7 (2001) 366–378.","chicago":"Domik, Gitta. “Glimpses into the Future of Computer Science Education.” <i>J. (UCS)</i> 7, no. 5 (2001): 366–78. <a href=\"https://doi.org/10.3217/jucs-007-05-0366\">https://doi.org/10.3217/jucs-007-05-0366</a>.","mla":"Domik, Gitta. “Glimpses into the Future of Computer Science Education.” <i>J. (UCS)</i>, vol. 7, no. 5, 2001, pp. 366–78, doi:<a href=\"https://doi.org/10.3217/jucs-007-05-0366\">10.3217/jucs-007-05-0366</a>.","bibtex":"@article{Domik_2001, title={Glimpses into the Future of Computer Science Education}, volume={7}, DOI={<a href=\"https://doi.org/10.3217/jucs-007-05-0366\">10.3217/jucs-007-05-0366</a>}, number={5}, journal={J. (UCS)}, author={Domik, Gitta}, year={2001}, pages={366–378} }","ama":"Domik G. Glimpses into the Future of Computer Science Education. <i>J (UCS)</i>. 2001;7(5):366-378. doi:<a href=\"https://doi.org/10.3217/jucs-007-05-0366\">10.3217/jucs-007-05-0366</a>"},"date_created":"2020-04-22T08:57:54Z","type":"journal_article","department":[{"_id":"65"}]},{"page":"125-135","language":[{"iso":"eng"}],"_id":"17027","doi":"10.3934/dcdsb.2001.1.125","user_id":"32829","volume":1,"title":"The numerical detection of connecting orbits","status":"public","year":"2001","publication_identifier":{"issn":["1531-3492"]},"author":[{"full_name":"Dellnitz, Michael","first_name":"Michael","last_name":"Dellnitz"},{"full_name":"Junge, Oliver","last_name":"Junge","first_name":"Oliver"},{"full_name":"Thiere, Bianca","first_name":"Bianca","last_name":"Thiere"}],"date_updated":"2022-01-06T06:53:02Z","publication_status":"published","intvolume":"         1","date_created":"2020-05-19T20:38:40Z","type":"journal_article","publication":"Discrete & Continuous Dynamical Systems - B","issue":"1531-3492_2001_1_125","citation":{"bibtex":"@article{Dellnitz_Junge_Thiere_2001, title={The numerical detection of connecting orbits}, volume={1}, DOI={<a href=\"https://doi.org/10.3934/dcdsb.2001.1.125\">10.3934/dcdsb.2001.1.125</a>}, number={1531-3492_2001_1_125}, journal={Discrete &#38; Continuous Dynamical Systems - B}, author={Dellnitz, Michael and Junge, Oliver and Thiere, Bianca}, year={2001}, pages={125–135} }","chicago":"Dellnitz, Michael, Oliver Junge, and Bianca Thiere. “The Numerical Detection of Connecting Orbits.” <i>Discrete &#38; Continuous Dynamical Systems - B</i> 1, no. 1531-3492_2001_1_125 (2001): 125–35. <a href=\"https://doi.org/10.3934/dcdsb.2001.1.125\">https://doi.org/10.3934/dcdsb.2001.1.125</a>.","ama":"Dellnitz M, Junge O, Thiere B. The numerical detection of connecting orbits. <i>Discrete &#38; Continuous Dynamical Systems - B</i>. 2001;1(1531-3492_2001_1_125):125-135. doi:<a href=\"https://doi.org/10.3934/dcdsb.2001.1.125\">10.3934/dcdsb.2001.1.125</a>","short":"M. Dellnitz, O. Junge, B. Thiere, Discrete &#38; Continuous Dynamical Systems - B 1 (2001) 125–135.","ieee":"M. Dellnitz, O. Junge, and B. Thiere, “The numerical detection of connecting orbits,” <i>Discrete &#38; Continuous Dynamical Systems - B</i>, vol. 1, no. 1531-3492_2001_1_125, pp. 125–135, 2001.","mla":"Dellnitz, Michael, et al. “The Numerical Detection of Connecting Orbits.” <i>Discrete &#38; Continuous Dynamical Systems - B</i>, vol. 1, no. 1531-3492_2001_1_125, 2001, pp. 125–35, doi:<a href=\"https://doi.org/10.3934/dcdsb.2001.1.125\">10.3934/dcdsb.2001.1.125</a>.","apa":"Dellnitz, M., Junge, O., &#38; Thiere, B. (2001). The numerical detection of connecting orbits. <i>Discrete &#38; Continuous Dynamical Systems - B</i>, <i>1</i>(1531-3492_2001_1_125), 125–135. <a href=\"https://doi.org/10.3934/dcdsb.2001.1.125\">https://doi.org/10.3934/dcdsb.2001.1.125</a>"}},{"page":"205-210","language":[{"iso":"eng"}],"_id":"10713","doi":"10.1109/92.920835","user_id":"398","volume":9,"year":"2001","title":"Object-oriented domain specific compilers for programming FPGAs","status":"public","author":[{"last_name":"Mencer","first_name":"Oskar","full_name":"Mencer, Oskar"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"},{"last_name":"Morf","first_name":"Martin","full_name":"Morf, Martin"},{"last_name":"J. Flynn","first_name":"Michael","full_name":"J. Flynn, Michael"}],"date_updated":"2022-01-06T06:50:50Z","intvolume":"         9","date_created":"2019-07-10T11:47:42Z","type":"journal_article","department":[{"_id":"78"}],"issue":"1","publication":"{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems","citation":{"ieee":"O. Mencer, M. Platzner, M. Morf, and M. J. Flynn, “Object-oriented domain specific compilers for programming FPGAs,” <i>{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems</i>, vol. 9, no. 1, pp. 205–210, 2001.","mla":"Mencer, Oskar, et al. “Object-Oriented Domain Specific Compilers for Programming FPGAs.” <i>{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems</i>, vol. 9, no. 1, 2001, pp. 205–10, doi:<a href=\"https://doi.org/10.1109/92.920835\">10.1109/92.920835</a>.","apa":"Mencer, O., Platzner, M., Morf, M., &#38; J. Flynn, M. (2001). Object-oriented domain specific compilers for programming FPGAs. <i>{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems</i>, <i>9</i>(1), 205–210. <a href=\"https://doi.org/10.1109/92.920835\">https://doi.org/10.1109/92.920835</a>","bibtex":"@article{Mencer_Platzner_Morf_J. Flynn_2001, title={Object-oriented domain specific compilers for programming FPGAs}, volume={9}, DOI={<a href=\"https://doi.org/10.1109/92.920835\">10.1109/92.920835</a>}, number={1}, journal={{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems}, author={Mencer, Oskar and Platzner, Marco and Morf, Martin and J. Flynn, Michael}, year={2001}, pages={205–210} }","chicago":"Mencer, Oskar, Marco Platzner, Martin Morf, and Michael J. Flynn. “Object-Oriented Domain Specific Compilers for Programming FPGAs.” <i>{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems</i> 9, no. 1 (2001): 205–10. <a href=\"https://doi.org/10.1109/92.920835\">https://doi.org/10.1109/92.920835</a>.","ama":"Mencer O, Platzner M, Morf M, J. Flynn M. Object-oriented domain specific compilers for programming FPGAs. <i>{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems</i>. 2001;9(1):205-210. doi:<a href=\"https://doi.org/10.1109/92.920835\">10.1109/92.920835</a>","short":"O. Mencer, M. Platzner, M. Morf, M. J. Flynn, {IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems 9 (2001) 205–210."},"extern":"1"},{"publication":"1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)","citation":{"mla":"Bischoff, R., et al. “Implementation of a Rake Receiver Architecture into a Galileo Receiver.” <i>1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)</i>, 2001.","ama":"Bischoff R, Haeb-Umbach R, Schulz W, Heinrichs G. Implementation of a Rake Receiver Architecture into a Galileo Receiver. In: <i>1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)</i>. ; 2001.","bibtex":"@inproceedings{Bischoff_Haeb-Umbach_Schulz_Heinrichs_2001, title={Implementation of a Rake Receiver Architecture into a Galileo Receiver}, booktitle={1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)}, author={Bischoff, R. and Haeb-Umbach, Reinhold and Schulz, W. and Heinrichs, G.}, year={2001} }","apa":"Bischoff, R., Haeb-Umbach, R., Schulz, W., &#38; Heinrichs, G. (2001). Implementation of a Rake Receiver Architecture into a Galileo Receiver. In <i>1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)</i>.","ieee":"R. Bischoff, R. Haeb-Umbach, W. Schulz, and G. Heinrichs, “Implementation of a Rake Receiver Architecture into a Galileo Receiver,” in <i>1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)</i>, 2001.","short":"R. Bischoff, R. Haeb-Umbach, W. Schulz, G. Heinrichs, in: 1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001), 2001.","chicago":"Bischoff, R., Reinhold Haeb-Umbach, W. Schulz, and G. Heinrichs. “Implementation of a Rake Receiver Architecture into a Galileo Receiver.” In <i>1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)</i>, 2001."},"type":"conference","department":[{"_id":"54"}],"oa":"1","date_created":"2019-07-12T05:27:14Z","date_updated":"2022-01-06T06:51:08Z","status":"public","title":"Implementation of a Rake Receiver Architecture into a Galileo Receiver","year":"2001","author":[{"full_name":"Bischoff, R.","last_name":"Bischoff","first_name":"R."},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"},{"full_name":"Schulz, W.","first_name":"W.","last_name":"Schulz"},{"first_name":"G.","last_name":"Heinrichs","full_name":"Heinrichs, G."}],"user_id":"44006","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2001/BiHaScHe01.pdf"}],"_id":"11734","language":[{"iso":"eng"}]},{"oa":"1","citation":{"mla":"Haeb-Umbach, Reinhold. “Automatic Generation of Phonetic Regression Class Trees for MLLR Adaptation.” <i>IEEE Transactions on Speech and Audio Processing</i>, vol. 9, no. 3, 2001, pp. 299–302, doi:<a href=\"https://doi.org/10.1109/89.906003\">10.1109/89.906003</a>.","bibtex":"@article{Haeb-Umbach_2001, title={Automatic generation of phonetic regression class trees for MLLR adaptation}, volume={9}, DOI={<a href=\"https://doi.org/10.1109/89.906003\">10.1109/89.906003</a>}, number={3}, journal={IEEE Transactions on Speech and Audio Processing}, author={Haeb-Umbach, Reinhold}, year={2001}, pages={299–302} }","ama":"Haeb-Umbach R. Automatic generation of phonetic regression class trees for MLLR adaptation. <i>IEEE Transactions on Speech and Audio Processing</i>. 2001;9(3):299-302. doi:<a href=\"https://doi.org/10.1109/89.906003\">10.1109/89.906003</a>","ieee":"R. Haeb-Umbach, “Automatic generation of phonetic regression class trees for MLLR adaptation,” <i>IEEE Transactions on Speech and Audio Processing</i>, vol. 9, no. 3, pp. 299–302, 2001.","apa":"Haeb-Umbach, R. (2001). Automatic generation of phonetic regression class trees for MLLR adaptation. <i>IEEE Transactions on Speech and Audio Processing</i>, <i>9</i>(3), 299–302. <a href=\"https://doi.org/10.1109/89.906003\">https://doi.org/10.1109/89.906003</a>","short":"R. Haeb-Umbach, IEEE Transactions on Speech and Audio Processing 9 (2001) 299–302.","chicago":"Haeb-Umbach, Reinhold. “Automatic Generation of Phonetic Regression Class Trees for MLLR Adaptation.” <i>IEEE Transactions on Speech and Audio Processing</i> 9, no. 3 (2001): 299–302. <a href=\"https://doi.org/10.1109/89.906003\">https://doi.org/10.1109/89.906003</a>."},"page":"299-302","_id":"11778","user_id":"44006","volume":9,"status":"public","date_created":"2019-07-12T05:28:04Z","type":"journal_article","keyword":["acoustic space","adaptation experiments","automatic generation","bottom-up clustering","broad phonetic class regression trees","correlation criterion","correlation methods","maximum likelihood estimation","maximum likelihood linear regression based speaker adaptation","MLLR adaptation","pattern clustering","phonetic regression class trees","speaker-independent training data","speech recognition","speech units","statistical analysis","trees (mathematics)"],"department":[{"_id":"54"}],"publication":"IEEE Transactions on Speech and Audio Processing","issue":"3","abstract":[{"lang":"eng","text":"In this paper, it is shown that a correlation criterion is the appropriate criterion for bottom-up clustering to obtain broad phonetic class regression trees for maximum likelihood linear regression (MLLR)-based speaker adaptation. The correlation structure among speech units is estimated on the speaker-independent training data. In adaptation experiments the tree outperformed a regression tree obtained from clustering according to closeness in acoustic space and achieved results comparable with those of a manually designed broad phonetic class tree"}],"main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2001/Ha01.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1109/89.906003","title":"Automatic generation of phonetic regression class trees for MLLR adaptation","year":"2001","author":[{"id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_updated":"2022-01-06T06:51:08Z","intvolume":"         9"},{"doi":"10.1109/34.935849","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2001/LoDuHa01.pdf"}],"intvolume":"        23","date_updated":"2022-01-06T06:51:11Z","author":[{"first_name":"M.","last_name":"Loog","full_name":"Loog, M."},{"first_name":"R.P.W.","last_name":"Duin","full_name":"Duin, R.P.W."},{"id":"242","first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold"}],"title":"Multiclass linear dimension reduction by weighted pairwise Fisher criteria","year":"2001","department":[{"_id":"54"}],"type":"journal_article","keyword":["approximate pairwise accuracy","Bayes error","Bayes methods","error statistics","Euclidean distance","Fisher criterion","linear dimension reduction","linear discriminant analysis","pattern classification","statistical analysis","statistical pattern classification","weighting function"],"date_created":"2019-07-12T05:29:51Z","abstract":[{"text":"We derive a class of computationally inexpensive linear dimension reduction criteria by introducing a weighted variant of the well-known K-class Fisher criterion associated with linear discriminant analysis (LDA). It can be seen that LDA weights contributions of individual class pairs according to the Euclidean distance of the respective class means. We generalize upon LDA by introducing a different weighting function","lang":"eng"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issue":"7","volume":23,"user_id":"44006","_id":"11870","page":"762-766","status":"public","oa":"1","citation":{"apa":"Loog, M., Duin, R. P. W., &#38; Haeb-Umbach, R. (2001). Multiclass linear dimension reduction by weighted pairwise Fisher criteria. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, <i>23</i>(7), 762–766. <a href=\"https://doi.org/10.1109/34.935849\">https://doi.org/10.1109/34.935849</a>","ieee":"M. Loog, R. P. W. Duin, and R. Haeb-Umbach, “Multiclass linear dimension reduction by weighted pairwise Fisher criteria,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 23, no. 7, pp. 762–766, 2001.","chicago":"Loog, M., R.P.W. Duin, and Reinhold Haeb-Umbach. “Multiclass Linear Dimension Reduction by Weighted Pairwise Fisher Criteria.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i> 23, no. 7 (2001): 762–66. <a href=\"https://doi.org/10.1109/34.935849\">https://doi.org/10.1109/34.935849</a>.","short":"M. Loog, R.P.W. Duin, R. Haeb-Umbach, IEEE Transactions on Pattern Analysis and Machine Intelligence 23 (2001) 762–766.","mla":"Loog, M., et al. “Multiclass Linear Dimension Reduction by Weighted Pairwise Fisher Criteria.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 23, no. 7, 2001, pp. 762–66, doi:<a href=\"https://doi.org/10.1109/34.935849\">10.1109/34.935849</a>.","ama":"Loog M, Duin RPW, Haeb-Umbach R. Multiclass linear dimension reduction by weighted pairwise Fisher criteria. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2001;23(7):762-766. doi:<a href=\"https://doi.org/10.1109/34.935849\">10.1109/34.935849</a>","bibtex":"@article{Loog_Duin_Haeb-Umbach_2001, title={Multiclass linear dimension reduction by weighted pairwise Fisher criteria}, volume={23}, DOI={<a href=\"https://doi.org/10.1109/34.935849\">10.1109/34.935849</a>}, number={7}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, author={Loog, M. and Duin, R.P.W. and Haeb-Umbach, Reinhold}, year={2001}, pages={762–766} }"}},{"date_created":"2019-12-11T15:47:43Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"publication":"In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany","citation":{"bibtex":"@inproceedings{Hüllermeier_2001, title={Experience-based decision making and learning from examples}, booktitle={In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany}, publisher={Springer}, author={Hüllermeier, Eyke}, year={2001} }","ama":"Hüllermeier E. Experience-based decision making and learning from examples. In: <i>In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany</i>. Springer; 2001.","mla":"Hüllermeier, Eyke. “Experience-Based Decision Making and Learning from Examples.” <i>In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany</i>, Springer, 2001.","chicago":"Hüllermeier, Eyke. “Experience-Based Decision Making and Learning from Examples.” In <i>In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany</i>. Springer, 2001.","short":"E. Hüllermeier, in: In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany, Springer, 2001.","ieee":"E. Hüllermeier, “Experience-based decision making and learning from examples,” in <i>In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany</i>, 2001.","apa":"Hüllermeier, E. (2001). Experience-based decision making and learning from examples. In <i>In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany</i>. Springer."},"publisher":"Springer","_id":"15300","language":[{"iso":"eng"}],"user_id":"49109","year":"2001","title":"Experience-based decision making and learning from examples","status":"public","author":[{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"date_updated":"2022-01-06T06:52:20Z"}]