@inbook{19345, author = {{Eke, Norbert Otto}}, booktitle = {{Die deutsche Tragödie. Neue Lektüren einer Gattung im europäischen Kontext}}, editor = {{Dörr, Volker C. and Schneider, Helmut J.}}, pages = {{235--254}}, publisher = {{Aisthesis}}, title = {{{Furcht und Schrecken im Theater der Erinnerung oder „Man sollte Komödien schreiben / Leben in diesem trüben Menschenbrei“. Heiner Müllers Tragödie}}}, year = {{2006}}, } @article{23881, abstract = {{Computing a maximum weighted stable set in a bipartite graph is considered well-solved and usually approached with preflow-push, Ford–Fulkerson or network simplex algorithms. We present a combinatorial algorithm for the problem that is not based on flows. Numerical tests suggest that this algorithm performs quite well in practice and is competitive with flow based algorithms especially in the case of dense graphs.}}, author = {{Faigle, Ulrich and Frahling, Gereon}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics}}, pages = {{1380--1391}}, title = {{{A combinatorial algorithm for weighted stable sets in bipartite graphs}}}, doi = {{10.1016/j.dam.2005.05.037}}, year = {{2006}}, } @inproceedings{23882, abstract = {{In this paper we develop an efficient implementation for a k-means clustering algorithm. Our algorithm is a variant of KMHybrid [28, 20], i.e. it uses a combination of Lloyd-steps and random swaps, but as a novel feature it uses coresets to speed up the algorithm. A coreset is a small weighted set of points that approximates the original point set with respect to the considered problem. The main strength of the algorithm is that it can quickly determine clusterings of the same point set for many values of k. This is necessary in many applications, since, typically, one does not know a good value for k in advance. Once we have clusterings for many different values of k we can determine a good choice of k using a quality measure of clusterings that is independent of k, for example the average silhouette coefficient. The average silhouette coefficient can be approximated using coresets.To evaluate the performance of our algorithm we compare it with algorithm KMHybrid [28] on typical 3D data sets for an image compression application and on artificially created instances. Our data sets consist of 300,000 to 4.9 million points. We show that our algorithm significantly outperforms KMHybrid on most of these input instances. Additionally, the quality of the solutions computed by our algorithm deviates less than that of KMHybrid.We also computed clusterings and approximate average silhouette coefficient for k=1,…,100 for our input instances and discuss the performance of our algorithm in detail.}}, author = {{Frahling, Gereon and Sohler, Christian}}, booktitle = {{Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06}}, title = {{{A fast k-means implementation using coresets}}}, doi = {{10.1145/1137856.1137879}}, year = {{2006}}, } @inproceedings{2401, abstract = {{ This paper presents a novel method for optimal temporal partitioning of sequential circuits for time-multiplexed reconfigurable architectures. The method bases on slowdown and retiming and maximizes the circuit's performance during execution while restricting the size of the partitions to respect the resource constraints of the reconfigurable architecture. We provide a mixed integer linear program (MILP) formulation of the problem, which can be solved exactly. In contrast to related work, our approach optimizes performance directly, takes structural modifications of the circuit into account, and is extensible. We present the application of the new method to temporal partitioning for a coarse-grained reconfigurable architecture. }}, author = {{Plessl, Christian and Platzner, Marco and Thiele, Lothar}}, booktitle = {{Proc. Int. Conf. on Field Programmable Technology (ICFPT)}}, keywords = {{temporal partitioning, retiming, ILP}}, pages = {{345--348}}, publisher = {{IEEE Computer Society}}, title = {{{Optimal Temporal Partitioning based on Slowdown and Retiming}}}, doi = {{10.1109/FPT.2006.270344}}, year = {{2006}}, } @article{2043, author = {{Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{6}}, pages = {{903----928}}, title = {{{The Effect of Faults on Network Expansion}}}, doi = {{10.1007/s00224-006-1349-0}}, year = {{2006}}, } @misc{20436, author = {{Hamann, Heiko}}, title = {{{Modeling and Investigation of Robot Swarms}}}, year = {{2006}}, } @book{2093, editor = {{Krimphove, Dieter}}, publisher = {{Eul-Verlag}}, title = {{{Jean-Monnet Schriftenreihe: Europäisches Wirtschaftsrecht}}}, year = {{2006}}, } @article{17979, author = {{Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}}, issn = {{0925-7721}}, journal = {{Computational Geometry}}, pages = {{197--214}}, title = {{{Geometric spanners with applications in wireless networks}}}, doi = {{10.1016/j.comgeo.2006.02.001}}, year = {{2006}}, } @article{17985, author = {{Ziegler, Martin}}, issn = {{0885-064X}}, journal = {{Journal of Complexity}}, pages = {{827--849}}, title = {{{Effectively open real functions}}}, doi = {{10.1016/j.jco.2006.05.002}}, year = {{2006}}, } @inbook{17987, author = {{Meer, Klaus and Ziegler, Martin}}, booktitle = {{Logical Approaches to Computational Barriers}}, isbn = {{9783540354666}}, issn = {{0302-9743}}, title = {{{Uncomputability Below the Real Halting Problem}}}, doi = {{10.1007/11780342_39}}, year = {{2006}}, } @book{18137, editor = {{Meister, Dorothee M.}}, title = {{{MedienPädagogik. Zeitschrift für Theorie und Praxis der Medienbildung }}}, year = {{2006}}, } @inproceedings{18351, abstract = {{In this paper the ideas of a new research project are presented. The material flow simu- lator d3FACT insight shall manage multiple parallel and time synchronous simulations to grand the power of real-time visualization in combination with statistical analysis. This research is issued to overcome the conflict of simulation run repetition for a good statistical basis and real-time immersive visualization. A side effect will be the reduc- tion of time needed for simulation experiments. The planned simulation tool has the feature of triggered cloning, i.e., the user can decide during runtime to clone a set of simulations after changing parameters to preserve the original system. The simulations will be aggregated by visualization and statistics. The rendering is planned to overlay several simulations using effects like inking and transparency. Simulation data will be aggregated with statistical functions and diagrams.}}, author = {{Dangelmaier, Wilhelm and Huber, Daniel and Laroque, Christoph and Aufenanger, Mark and Fischer, Matthias and Krokowski, Jens and Kortenjan, Michael}}, booktitle = {{Simulation and Visualization 2006 (SimViS)}}, pages = {{79--88}}, publisher = {{SCS European Publishing House}}, title = {{{d³FACT insight goes parallel - Aggregation of multiple simulations}}}, year = {{2006}}, } @inbook{18601, author = {{Friedrich, Christoph and Schindlmayr, Arno}}, booktitle = {{Computational Condensed Matter Physics}}, editor = {{Blügel, Stefan and Gompper, Gerhard and Koch, Erik and Müller-Krumbhaar, Heiner and Spatschek, Robert and Winkler, Roland G.}}, isbn = {{3-89336-430-7}}, issn = {{1433-5506}}, location = {{Jülich}}, pages = {{A5.1--A5.21}}, publisher = {{Forschungszentrum Jülich}}, title = {{{Many-body perturbation theory: The GW approximation}}}, volume = {{32}}, year = {{2006}}, } @inbook{18603, author = {{Schindlmayr, Arno}}, booktitle = {{Computational Condensed Matter Physics}}, editor = {{Blügel, Stefan and Gompper, Gerhard and Koch, Erik and Müller-Krumbhaar, Heiner and Spatschek, Robert and Winkler, Roland G.}}, isbn = {{3-89336-430-7}}, issn = {{1433-5506}}, location = {{Jülich}}, pages = {{A4.1--A4.19}}, publisher = {{Forschungszentrum Jülich}}, title = {{{Time-dependent density-functional theory}}}, volume = {{32}}, year = {{2006}}, } @inbook{18606, abstract = {{In this lecture we present many-body perturbation theory as a method to determine quasiparticle excitations in solids, especially electronic band structures, accurately from first principles. The main ingredient is the electronic self-energy that, in principle, contains all many-body exchange and correlation effects beyond the Hartree potential. As its exact mathematical expression is unknown, approximations must be used in practical calculations. The approximation is obtained using a systematic algebraic approach on the basis of Green function techniques. It constitutes an expansion of the self-energy up to linear order in the screened Coulomb potential, which describes the interaction between the quasiparticles and includes dynamic screening through the creation of exchange-correlation holes around the bare particles. The implementation of the approximation relies on a perturbative treatment starting from density functional theory. Besides a detailed mathematical discussion we focus on the underlying physical concepts and show some illustrative applications.}}, author = {{Friedrich, Christoph and Schindlmayr, Arno}}, booktitle = {{Computational Nanoscience: Do It Yourself!}}, editor = {{Grotendorst, Johannes and Blügel, Stefan and Marx, Dominik}}, isbn = {{3-00-017350-1}}, location = {{Jülich}}, pages = {{335--355}}, publisher = {{John von Neumann Institute for Computing}}, title = {{{Many-body perturbation theory: The GW approximation}}}, volume = {{31}}, year = {{2006}}, } @article{18672, author = {{Sohler, Christian and Czumaj, Artur}}, journal = {{EATCS Bulletin}}, number = {{89}}, pages = {{23----47}}, title = {{{Sublinear-time Algorithms}}}, year = {{2006}}, } @inproceedings{2213, author = {{Scheideler, Christian}}, booktitle = {{6th International HNI Symposium on New Trends in Parallel and Distributed Computing}}, title = {{{Towards a paradigm for robust distributed algorithms and data structures}}}, year = {{2006}}, } @article{22328, author = {{Zimmer, Detmar and Bo, Jianquan}}, journal = {{Forschungsforum Paderborn - Paderborner Universitätsmagazin }}, pages = {{38--42}}, title = {{{Dynamische Laufzeitprognose bei Extrudergetrieben. Umsetzung ingenieurwissenschaftlichen Wissens in die industrielle Anwendung}}}, doi = {{https://www.uni-paderborn.de/fileadmin/marketing/forschungsforum-paderborn/forschungsforum-paderborn-09-2006.pdf}}, volume = {{9}}, year = {{2006}}, } @phdthesis{22329, author = {{Denzer, Vera}}, isbn = {{978-3-89959-501-7}}, publisher = {{Der Andere Verlag}}, title = {{{Methodik zur funktions-, fertigungs- und prüfgerechten Bemaßung und Tolerierung}}}, year = {{2006}}, } @book{22915, author = {{Sureth-Sloane, Caren}}, isbn = {{9783835002685}}, publisher = {{Deutscher Universitäts-Verlag}}, title = {{{Steuerreformen und Übergangsprobleme bei Beteiligungsinvestitionen}}}, doi = {{10.1007/978-3-8350-9097-2}}, year = {{2006}}, }