@inproceedings{995,
  author       = {{Karl, Holger and Mengesha, Seble}},
  booktitle    = {{Proc. of IEEE Intl. Conf. on Wireless LANs and Home Networks}},
  pages        = {{339----348}},
  title        = {{{Analysing capacity improvements in wireless networks by relaying}}},
  year         = {{2001}},
}

@inproceedings{996,
  author       = {{Quynh, T and Karl, Holger and Wolisz, Adam and Rebensburg, Klaus}},
  booktitle    = {{Proc. 9th IFIP Conf. Perf. Modeling and Eval. of ATM & IP Networks}},
  title        = {{{Relative jitter packet scheduling for differentiated services}}},
  year         = {{2001}},
}

@article{5105,
  author       = {{Clark, Damon and Fahr, Rene}},
  journal      = {{CEP Discussion Paper No. 528}},
  publisher    = {{London School of Economics}},
  title        = {{{The promise of workplace training for non-college-bound youth: Theory and evidence from German apprenticeship}}},
  volume       = {{528}},
  year         = {{2001}},
}

@book{5670,
  author       = {{Schryen, Guido}},
  publisher    = {{Deutscher Universitäts-Verlag}},
  title        = {{{Komponentenorientierte Softwareentwicklung in Softwareunternehmen: Konzeption eines Vorgehensmodells zur Einführung und Etablierung}}},
  year         = {{2001}},
}

@book{6760,
  editor       = {{Tönnies, Merle and Viol, Claus-Ulrich}},
  publisher    = {{Reclam}},
  title        = {{{British Political Speeches from Churchill to Blair}}},
  year         = {{2001}},
}

@inproceedings{16492,
  abstract     = {{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.}},
  author       = {{Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}},
  booktitle    = {{Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH '01}},
  isbn         = {{158113374X}},
  title        = {{{The randomized z-buffer algorithm}}},
  doi          = {{10.1145/383259.383299}},
  year         = {{2001}},
}

@inbook{16493,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Graph-Theoretic Concepts in Computer Science}},
  isbn         = {{9783540427070}},
  issn         = {{0302-9743}},
  title        = {{{Data Management in Networks}}},
  doi          = {{10.1007/3-540-45477-2_2}},
  volume       = {{2204}},
  year         = {{2001}},
}

@inbook{16494,
  author       = {{Meyer auf der Heide, Friedhelm and Wanka, Rolf}},
  booktitle    = {{Computational Science - ICCS 2001}},
  isbn         = {{9783540422334}},
  issn         = {{0302-9743}},
  title        = {{{Parallel Bridging Models and Their Impact on Algorithm Design}}},
  doi          = {{10.1007/3-540-45718-6_68}},
  year         = {{2001}},
}

@inbook{16555,
  author       = {{Dellnitz, Michael and Froyland, Gary and Junge, Oliver}},
  booktitle    = {{Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems}},
  isbn         = {{9783642625244}},
  title        = {{{The Algorithms Behind GAIO — Set Oriented Numerical Methods for Dynamical Systems}}},
  doi          = {{10.1007/978-3-642-56589-2_7}},
  year         = {{2001}},
}

@inbook{16598,
  author       = {{Froyland, Gary}},
  booktitle    = {{Nonlinear Dynamics and Statistics}},
  isbn         = {{9781461266488}},
  title        = {{{Extracting Dynamical Behavior via Markov Models}}},
  doi          = {{10.1007/978-1-4612-0177-9_12}},
  year         = {{2001}},
}

@article{16601,
  author       = {{Froyland, Gary and Junge, Oliver and Ochs, Gunter}},
  issn         = {{0167-2789}},
  journal      = {{Physica D: Nonlinear Phenomena}},
  pages        = {{68--84}},
  title        = {{{Rigorous computation of topological entropy with respect to a finite partition}}},
  doi          = {{10.1016/s0167-2789(01)00216-0}},
  year         = {{2001}},
}

@article{16617,
  author       = {{Junge, Oliver}},
  issn         = {{1468-9367}},
  journal      = {{Dynamical Systems}},
  pages        = {{213--222}},
  title        = {{{An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence}}},
  doi          = {{10.1080/14689360109696233}},
  year         = {{2001}},
}

@book{16722,
  editor       = {{Meyer auf der Heide, Friedhelm}},
  isbn         = {{9783540424932}},
  issn         = {{0302-9743}},
  publisher    = {{Springer }},
  title        = {{{Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}}},
  doi          = {{10.1007/3-540-44676-1}},
  year         = {{2001}},
}

@article{16811,
  author       = {{Domik, Gitta}},
  journal      = {{J. (UCS)}},
  number       = {{5}},
  pages        = {{366--378}},
  title        = {{{Glimpses into the Future of Computer Science Education}}},
  doi          = {{10.3217/jucs-007-05-0366}},
  volume       = {{7}},
  year         = {{2001}},
}

@article{17027,
  author       = {{Dellnitz, Michael and Junge, Oliver and Thiere, Bianca}},
  issn         = {{1531-3492}},
  journal      = {{Discrete & Continuous Dynamical Systems - B}},
  number       = {{1531-3492_2001_1_125}},
  pages        = {{125--135}},
  title        = {{{The numerical detection of connecting orbits}}},
  doi          = {{10.3934/dcdsb.2001.1.125}},
  volume       = {{1}},
  year         = {{2001}},
}

@article{10713,
  author       = {{Mencer, Oskar and Platzner, Marco and Morf, Martin and J. Flynn, Michael}},
  journal      = {{{IEEE} Transactions on Very Large Scale Integration ({VLSI}) Systems}},
  number       = {{1}},
  pages        = {{205--210}},
  title        = {{{Object-oriented domain specific compilers for programming FPGAs}}},
  doi          = {{10.1109/92.920835}},
  volume       = {{9}},
  year         = {{2001}},
}

@inproceedings{11734,
  author       = {{Bischoff, R. and Haeb-Umbach, Reinhold and Schulz, W. and Heinrichs, G.}},
  booktitle    = {{1st ESA Workshop on Satellite Navigation User Equipment Technology (Navitec 2001)}},
  title        = {{{Implementation of a Rake Receiver Architecture into a Galileo Receiver}}},
  year         = {{2001}},
}

@article{11778,
  abstract     = {{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}},
  author       = {{Haeb-Umbach, Reinhold}},
  journal      = {{IEEE Transactions on Speech and Audio Processing}},
  keywords     = {{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)}},
  number       = {{3}},
  pages        = {{299--302}},
  title        = {{{Automatic generation of phonetic regression class trees for MLLR adaptation}}},
  doi          = {{10.1109/89.906003}},
  volume       = {{9}},
  year         = {{2001}},
}

@article{11870,
  abstract     = {{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}},
  author       = {{Loog, M. and Duin, R.P.W. and Haeb-Umbach, Reinhold}},
  journal      = {{IEEE Transactions on Pattern Analysis and Machine Intelligence}},
  keywords     = {{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}},
  number       = {{7}},
  pages        = {{762--766}},
  title        = {{{Multiclass linear dimension reduction by weighted pairwise Fisher criteria}}},
  doi          = {{10.1109/34.935849}},
  volume       = {{23}},
  year         = {{2001}},
}

@inproceedings{15300,
  author       = {{Hüllermeier, Eyke}},
  booktitle    = {{In Proceedings SOR-01 Symposium on Operations Research, Duisburg, Germany}},
  publisher    = {{Springer}},
  title        = {{{Experience-based decision making and learning from examples}}},
  year         = {{2001}},
}