@inproceedings{19001, abstract = {{We present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web Computing Library (PUBWCL), which formerly used a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. Using distributed heterogeneous hash tables (DHHT), our architecture features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations. }}, author = {{Gehweiler, Joachim and Schomaker, Gunnar}}, booktitle = {{Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)}}, isbn = {{0769526977}}, pages = {{51--58}}, title = {{{Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}}}, doi = {{10.1109/ds-rt.2006.15}}, year = {{2006}}, } @book{19081, editor = {{Allkemper, Alo and Eke, Norbert Otto}}, pages = {{197}}, publisher = {{Erich Schmidt}}, title = {{{Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts}}}, year = {{2006}}, } @book{19082, editor = {{Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{344}}, publisher = {{Erich Schmidt}}, title = {{{Shoah in der deutschsprachigen Literatur}}}, year = {{2006}}, } @inbook{19141, author = {{Seng, Eva- Maria}}, booktitle = {{Dimensionen der Politik: Aufklärung, Utopie, Demokratie. Festschrift für Richard Saage zum 65. Geburtstag}}, editor = {{Rüdiger, Axel and Seng, Eva-Maria}}, pages = {{273--304}}, title = {{{Der Kult der Arbeit als Ausgangspunkt für das neue menschliche Gemeinwesen der Zukunft. Émile Zolas „Le Travail“: Ein Urbild des Städtebaus im 20. Jahrhundert}}}, year = {{2006}}, } @article{19339, author = {{Eke, Norbert Otto}}, journal = {{Zeitschrift für deutsche Philologie 125, Sonderheft: Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts}}, pages = {{64--81}}, publisher = {{Erich Schmidt, Berlin}}, title = {{{„Im Kopf die Toten verwesen nicht“. Werner Fritschs „Theater des Todes“}}}, year = {{2006}}, } @article{19340, author = {{Eke, Norbert Otto and Allkemper, Alo}}, journal = {{Zeitschrift für deutsche Philologie 125, Sonderheft: Das Gedächtnis der Literatur. Konstitutionsformen des Vergangenen in der Literatur des 20. Jahrhunderts}}, pages = {{2--4}}, publisher = {{Erich Schmidt, Berlin}}, title = {{{Das Gedächtnis der Literatur. Zur Einführung}}}, year = {{2006}}, } @inbook{19341, author = {{Eke, Norbert Otto}}, booktitle = {{Deutsche Kurzprosa der Gegenwart}}, editor = {{Bellmann, Werner and Hummel, Christine}}, pages = {{131--139}}, publisher = {{Reclam}}, title = {{{Thomas Brasch: Fliegen im Gesicht}}}, year = {{2006}}, } @inbook{19342, author = {{Eke, Norbert Otto}}, booktitle = {{Deutsche Kurzprosa der Gegenwart}}, editor = {{Bellmann, Werner and Hummel, Christine}}, pages = {{160--168}}, publisher = {{Reclam}}, title = {{{Herta Müller: Drückender Tango}}}, year = {{2006}}, } @inbook{19343, author = {{Eke, Norbert Otto}}, booktitle = {{Shoah in der deutschsprachigen Literatur}}, editor = {{Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{85--106}}, publisher = {{Erich Schmidt}}, title = {{{Konfigurationen der Shoah in der Literatur der DDR}}}, year = {{2006}}, } @inbook{19344, author = {{Eke, Norbert Otto}}, booktitle = {{Shoah in der deutschsprachigen Literatur}}, editor = {{Eke, Norbert Otto and Steinecke, Hartmut}}, pages = {{7--18}}, publisher = {{Erich Schmidt}}, title = {{{Shoah in der deutschsprachigen Literatur}}}, year = {{2006}}, } @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}}, }