@article{1746, author = {{Christ, A. and Zentgraf, Thomas and Kuhl, J. and Tikhodeev, S. G. and Gippius, N. A. and Giessen, H.}}, issn = {{1098-0121}}, journal = {{Physical Review B}}, number = {{12}}, publisher = {{American Physical Society (APS)}}, title = {{{Optical properties of planar metallic photonic crystal structures: Experiment and theory}}}, doi = {{10.1103/physrevb.70.125113}}, volume = {{70}}, year = {{2004}}, } @article{1747, author = {{Zentgraf, Thomas and Christ, A. and Kuhl, J. and Giessen, H.}}, issn = {{0031-9007}}, journal = {{Physical Review Letters}}, number = {{24}}, publisher = {{American Physical Society (APS)}}, title = {{{Tailoring the Ultrafast Dephasing of Quasiparticles in Metallic Photonic Crystals}}}, doi = {{10.1103/physrevlett.93.243901}}, volume = {{93}}, year = {{2004}}, } @misc{17684, author = {{Peckhaus, Volker}}, booktitle = {{Lexikon der bedeutenden Naturwissenschaftler in drei Bänden, Bd. 3: Men–Z}}, editor = {{Hoffmann, Dieter and Laitko, Hubert and Müller-Wille, Staffan}}, pages = {{475}}, publisher = {{Spektrum Akademischer Verlag}}, title = {{{Wolff, Christian Freiherr von}}}, year = {{2004}}, } @inproceedings{18777, author = {{Sohler, Christian and Damerow, Valentina}}, booktitle = {{Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04)}}, pages = {{93 -- 96}}, title = {{{Smoothed Number of Extreme Points under Uniform Noise}}}, year = {{2004}}, } @inproceedings{18778, abstract = {{Given a point set P in the d-dimensional unit hypercube, we give upper bounds on the maximal expected number of extreme points when each point is perturbed by small random noise chosen independently for each point from the same noise distribution Δ. Our results are parametrized by the variance of the noise distribution. For large variance we essentially consider the average case for distribution Δ while for variance 0 we consider the worst case. Hence our results give upper bounds on the number of extreme points where our input distributions range from average case to worst case.
Our main contribution is a rather general lemma that can be used to obtain upper bounds on the expected number of extreme points for a large class of noise distributions. We then apply this lemma to obtain explicit bounds for random noise coming from the Gaussian normal distribution of variance σ² and the uniform distribution in a hypercube of side length &epsilon. For these noise distributions we show upper bounds of O( (1/ σ )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / ε )^d/(d+1) ), respectively. Besides its theoretical motivation our model is also motivated by the observation that in many applications of convex hull algorithms the input data is inherently noisy, e.g. when the data comes from physical measurement or imprecise arithmetic is used.}}, author = {{Damerow, Valentina and Sohler, Christian}}, booktitle = {{Proceedings of the 12th European Symposium on Algorithms (ESA'04)}}, isbn = {{9783540230250}}, issn = {{0302-9743}}, title = {{{Extreme Points Under Random Noise}}}, doi = {{10.1007/978-3-540-30140-0_25}}, year = {{2004}}, } @inproceedings{18785, abstract = {{A limiting factor in the performance of a render- ing system is the number of state changes, i.e., changes of the attributes material, texture, shader program, etc., in the stream of rendered primitives. We propose to include a small buffer between appli- cation and graphics hardware in the rendering sys- tem. This pipeline buffer is used to rearrange the incoming sequence of primitives on-line and locally in such a way that the number of state changes is minimized. This method is generic; it can be easily integrated into existing rendering systems. In our experiments a pipeline buffer reduces the number of state changes by an order of magnitude and achieves almost the same rendering time as an optimal, i.e., presorted, sequence without pipeline buffer. Due to its simple structure and its low mem- ory requirements this method can easily be imple- mented in software or even hardware.}}, author = {{Sohler, Christian and Krokowski, Jens and Räcke, Harald and Westermann, Matthias}}, booktitle = {{Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004)}}, title = {{{Reducing State Changes with a Pipeline Buffer}}}, year = {{2004}}, } @inproceedings{18786, author = {{Sohler, Christian and Czumaj, Artur}}, booktitle = {{Automata, Languages and Programming (ICALP)}}, number = {{1}}, pages = {{396--407}}, title = {{{Sublinear-Time Approximation for Clustering via Random Sampling}}}, year = {{2004}}, } @book{19010, abstract = {{2. Auflage 2006}}, author = {{Eke, Norbert Otto and Allkemper, Alo}}, pages = {{316}}, publisher = {{Fink}}, title = {{{Literaturwissenschaft}}}, year = {{2004}}, } @inproceedings{1911, author = {{Aguiar, Ana and Karl, Holger and Wolisz, Adam}}, booktitle = {{Proceedings of European Wireless 2004, Barcelona / Spain }}, title = {{{Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy}}}, year = {{2004}}, } @inbook{19143, author = {{Seng, Eva- Maria}}, booktitle = {{Katalog der Landeskunstausstellung Sachsen-Anhalts in Magdeburg 2004}}, title = {{{Einleitung „in der zeit“ – kunst aus sachsen-anhalt 2004}}}, year = {{2004}}, } @inbook{19347, author = {{Eke, Norbert Otto}}, booktitle = {{Mahagonny.com. The Brecht Yearbook 29}}, pages = {{379--393}}, title = {{{Götter in der Stadt oder: „Wo Aas ist, sammeln sich die Geier!“ Stadtuntergänge bei Brecht und Trolle}}}, volume = {{29}}, year = {{2004}}, } @inbook{19348, author = {{Eke, Norbert Otto}}, booktitle = {{Crossing Media. Theater – Film – Fotografie – Neue Medien}}, editor = {{Balme, Christopher and Moninger, Markus}}, pages = {{121--146}}, publisher = {{epodium}}, title = {{{Intermedialität und Theatralisierung: Peter Greenaways Film-Theater}}}, volume = {{5}}, year = {{2004}}, } @inbook{19349, author = {{Eke, Norbert Otto}}, booktitle = {{„Der Text ist der Coyote“. Heiner Müller Bestandsaufnahme}}, editor = {{Mayer, Brigitte and Schulte, Christian}}, pages = {{51--69}}, publisher = {{Suhrkamp}}, title = {{{Eingebunkert – Stalin/Hitler: eine Konfiguration}}}, year = {{2004}}, } @article{20482, author = {{Weiß, M and Barthel, T and Baumeister, Jochen}}, journal = {{ForschungsForum}}, pages = {{62--67}}, title = {{{Stressmodelle und Analyse der Hirntätigkeit}}}, volume = {{7}}, year = {{2004}}, } @inproceedings{20931, abstract = {{Object-oriented software development is a subject area difficult to teach, espcially to beginners. They face a lot of abstraction and (from a beginners point of view) isolated topics, such as the syntax and semantics of a programming language, the functionality of a software development environment and basic object-oriented concepts. Although many professionals in education believe in the ``object first'' approach as the best method of introducing object-oriented concepts, there is no common agreement on how to start such courses. Current study programs often begin by teaching a programming language, instead of focusing on the basics of object-oriented concepts. In the last years a learning environment was developed based on a visual programming language to abstract away from details. It assists teaching step-by-step object-oriented concepts and the syntax and semantics of a programming language in secondary schools and first year university courses. Our goal is to port this learning environment to the widely used IDE Eclipse.}}, author = {{Meyer, Matthias and Wendehals, Lothar}}, booktitle = {{Proc. of the Eclipse Technology eXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada}}, pages = {{1--5}}, publisher = {{ACM Press}}, title = {{{Teaching Object-Oriented Concepts with Eclipse}}}, year = {{2004}}, } @inproceedings{20932, abstract = {{Design recovery, which means extracting design documents from source code, is usually done by static analysis techniques. Analysing behaviour by static analysis is very imprecise. We combine static and dynamic analysis to increase the preciseness of our design recovery process. In this paper we present an approach to collect data for the dynamic analysis by recording method calls during a program's execution. To reduce the amount of information we monitor only relevant classes and methods identified by static analysis.}}, author = {{Wendehals, Lothar and Meyer, Matthias and Elsner, Andreas}}, booktitle = {{Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany}}, pages = {{7--10}}, publisher = {{University of Paderborn}}, title = {{{Selective Tracing of Java Programs}}}, volume = {{tr-ri-04-253}}, year = {{2004}}, } @article{17969, author = {{Sureth-Sloane, Caren and Müller, Jens and Nordhoff, Daniel}}, journal = {{BBK - Buchführung, Bilanzierung, Kostenrechnung}}, number = {{11}}, pages = {{1517--1520}}, title = {{{Aktuelle Änderungen beim Betriebsausgabenabzug - Geschenke, Bewirtungskosten, Fahrtkostenzuschüsse und Halbjahres-AfA}}}, volume = {{30}}, year = {{2004}}, } @article{17986, author = {{Ziegler, Martin and Brattka, Vasco}}, journal = {{Theoretical Computer Science}}, number = {{1-3}}, pages = {{187--211}}, title = {{{Computability in linear algebra}}}, doi = {{https://doi.org/10.1016/j.tcs.2004.06.022}}, volume = {{326}}, year = {{2004}}, } @inproceedings{18260, abstract = {{For uniform computability of regular sets in Euclidean space, previous work has identified twelve 'basic' notions, to (pairs of) which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions, we now investigate on the computability of natural OPERATIONS on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions.}}, author = {{Ziegler, Martin}}, booktitle = {{Computability and Complexity in Analysis}}, issn = {{0942-5616}}, number = {{4-5}}, pages = {{392--404}}, title = {{{Computable operators on regular sets}}}, doi = {{10.1002/malq.200310107}}, volume = {{50}}, year = {{2004}}, } @inproceedings{18263, abstract = {{We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients, simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N^0.334) per point.}}, author = {{Nüsken, Michael and Ziegler, Martin}}, booktitle = {{Proc. 12th Annual Symposium on Algorithms (ESA'04)}}, isbn = {{9783540230250}}, issn = {{0302-9743}}, pages = {{544--555}}, publisher = {{Springer}}, title = {{{Fast Multipoint Evaluation of Bivariate Polynomials}}}, doi = {{10.1007/978-3-540-30140-0_49}}, volume = {{3221}}, year = {{2004}}, }