[{"author":[{"full_name":"Kortenjan, Michael","first_name":"Michael","last_name":"Kortenjan"},{"first_name":"Gunnar","last_name":"Schomaker","full_name":"Schomaker, Gunnar"}],"title":"Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes","year":"2006","status":"public","date_updated":"2022-01-06T06:54:14Z","language":[{"iso":"eng"}],"_id":"19932","user_id":"15415","doi":"10.1145/1108590.1108608","citation":{"mla":"Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>.","bibtex":"@inproceedings{Kortenjan_Schomaker_2006, title={Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}, DOI={<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>}, booktitle={4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}, author={Kortenjan, Michael and Schomaker, Gunnar}, year={2006} }","ama":"Kortenjan M, Schomaker G. Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In: <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>","ieee":"M. Kortenjan and G. Schomaker, “Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes,” in <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006.","apa":"Kortenjan, M., &#38; Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>. <a href=\"https://doi.org/10.1145/1108590.1108608\">https://doi.org/10.1145/1108590.1108608</a>","short":"M. Kortenjan, G. Schomaker, in: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006.","chicago":"Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” In <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006. <a href=\"https://doi.org/10.1145/1108590.1108608\">https://doi.org/10.1145/1108590.1108608</a>."},"publication":"4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)","abstract":[{"lang":"eng","text":"#hniid 2484"}],"date_created":"2020-10-06T13:32:47Z","department":[{"_id":"63"}],"type":"conference"},{"user_id":"15415","doi":"10.1007/11611257_37","language":[{"iso":"eng"}],"_id":"24277","publication_status":"published","date_updated":"2022-01-06T06:56:13Z","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Kutyłowski","first_name":"Jarosław","full_name":"Kutyłowski, Jarosław"},{"first_name":"Filip","last_name":"Zagórski","full_name":"Zagórski, Filip"}],"title":"Reliable Broadcasting Without Collision Detection","year":"2006","status":"public","department":[{"_id":"63"}],"type":"conference","date_created":"2021-09-13T13:28:29Z","place":"Berlin, Heidelberg","abstract":[{"lang":"eng","text":"We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.\r\n\r\nWe provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations."}],"citation":{"bibtex":"@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable Broadcasting Without Collision Detection}, DOI={<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>}, booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski, Jarosław and Zagórski, Filip}, year={2006} }","ama":"Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>","mla":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” <i>SOFSEM 2006: Theory and Practice of Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","chicago":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” In <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>.","short":"J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.","ieee":"J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: <a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","apa":"Kutyłowski, J., &#38; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>"},"publication":"SOFSEM 2006: Theory and Practice of Computer Science"},{"publication":"14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)","citation":{"chicago":"Brinkmann, Andre, Sascha  Effert, Michael Heidebuer, and Mario Vodisek. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” In <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>, 2006. <a href=\"https://doi.org/10.1109/pdp.2006.44\">https://doi.org/10.1109/pdp.2006.44</a>.","short":"A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006.","apa":"Brinkmann, A., Effert, S., Heidebuer, M., &#38; Vodisek, M. (2006). Influence of adaptive data layouts on performance in dynamically changing storage environments. <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>. <a href=\"https://doi.org/10.1109/pdp.2006.44\">https://doi.org/10.1109/pdp.2006.44</a>","ieee":"A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive data layouts on performance in dynamically changing storage environments,” 2006, doi: <a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>.","ama":"Brinkmann A, Effert S, Heidebuer M, Vodisek M. Influence of adaptive data layouts on performance in dynamically changing storage environments. In: <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>","bibtex":"@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Influence of adaptive data layouts on performance in dynamically changing storage environments}, DOI={<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>}, booktitle={14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)}, author={Brinkmann, Andre and Effert, Sascha  and Heidebuer, Michael and Vodisek, Mario}, year={2006} }","mla":"Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>."},"abstract":[{"lang":"eng","text":"For most of today's IT environments, the tremendous need for storage capacity in combination with a required minimum I/O performance has become highly critical. In dynamically growing environments, a storage management solution's underlying data distribution scheme has great impact to the overall system I/O performance. The evaluation of a number of open system storage visualization solutions and volume managers has shown that all of them lack the ability to automatically adapt to changing access patterns and storage infrastructures; many of them require an error prone manual re-layout of the data blocks, or rely on a very time consuming re-striping of all available data. This paper evaluates the performance of conventional data distribution approaches compared to the adaptive virtualization solution V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure are normally not considered in benchmark results, but can have a significant impact on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such changing environments with the non-adaptive Linux logical volume manager (LVM). The performance results of our tests clearly outline the necessity of adaptive data distribution schemes."}],"date_created":"2021-10-28T08:33:09Z","type":"conference","department":[{"_id":"63"},{"_id":"26"}],"title":"Influence of adaptive data layouts on performance in dynamically changing storage environments","status":"public","year":"2006","author":[{"full_name":"Brinkmann, Andre","first_name":"Andre","last_name":"Brinkmann"},{"last_name":"Effert","first_name":"Sascha ","full_name":"Effert, Sascha "},{"first_name":"Michael","last_name":"Heidebuer","full_name":"Heidebuer, Michael"},{"full_name":"Vodisek, Mario","first_name":"Mario","last_name":"Vodisek"}],"date_updated":"2022-01-06T06:57:31Z","publication_status":"published","_id":"26988","language":[{"iso":"eng"}],"doi":"10.1109/pdp.2006.44","user_id":"15415"},{"type":"conference_editor","department":[{"_id":"63"},{"_id":"26"}],"place":"Paderborn","date_created":"2020-07-27T13:00:52Z","abstract":[{"lang":"eng","text":"We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality."}],"citation":{"ieee":"F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide, and A. Trächtler, Eds., <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","mla":"Rammig, Franz-Josef, et al., editors. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","apa":"Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide, F., &#38; Trächtler, A. (Eds.). (2006). <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts.","bibtex":"@book{Rammig_Dangelmaier_Karl_Mertsching_Meyer auf der Heide_Trächtler_2006, place={Paderborn}, series={Proceedings of the 6th International Heinz Nixdorf Symposium}, title={Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, year={2006}, collection={Proceedings of the 6th International Heinz Nixdorf Symposium} }","short":"F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide, A. Trächtler, eds., Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Rammig F-J, Dangelmaier W, Karl H, Mertsching B, Meyer auf der Heide F, Trächtler A, eds. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006.","chicago":"Rammig, Franz-Josef, Wilhelm Dangelmaier, Holger Karl, Bärbel Mertsching, Friedhelm Meyer auf der Heide, and Ansgar Trächtler, eds. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Proceedings of the 6th International Heinz Nixdorf Symposium. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006."},"user_id":"15415","editor":[{"full_name":"Rammig, Franz-Josef","first_name":"Franz-Josef","last_name":"Rammig"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"first_name":"Bärbel","last_name":"Mertsching","full_name":"Mertsching, Bärbel"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Trächtler","first_name":"Ansgar","full_name":"Trächtler, Ansgar"}],"language":[{"iso":"eng"}],"_id":"17417","series_title":"Proceedings of the 6th International Heinz Nixdorf Symposium","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2022-01-06T06:53:11Z","status":"public","year":"2006","title":"Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems"},{"publication_identifier":{"isbn":["978-3-939350-00-2"]},"author":[{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"title":"New trends in parallel and distributed computing","status":"public","year":"2006","intvolume":"       181","date_updated":"2022-01-06T06:53:12Z","language":[{"iso":"eng"}],"_id":"17475","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":181,"alternative_title":["6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf MuseumsForum: within the scope of the {DFG} Collaborative Research Centre 376 Massively Parallel Computing: algorithms, design, methods, applications"],"user_id":"5786","citation":{"mla":"Monien, Burkhard, and Friedhelm Meyer auf der Heide. <i>New Trends in Parallel and Distributed Computing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Monien B, Meyer auf der Heide F. <i>New Trends in Parallel and Distributed Computing</i>. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","bibtex":"@book{Monien_Meyer auf der Heide_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={New trends in parallel and distributed computing}, volume={181}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Monien, Burkhard and Meyer auf der Heide, Friedhelm}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Monien, B., &#38; Meyer auf der Heide, F. (2006). <i>New trends in parallel and distributed computing</i> (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Monien and F. Meyer auf der Heide, <i>New trends in parallel and distributed computing</i>, vol. 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","chicago":"Monien, Burkhard, and Friedhelm Meyer auf der Heide. <i>New Trends in Parallel and Distributed Computing</i>. Vol. 181. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"B. Monien, F. Meyer auf der Heide, New Trends in Parallel and Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"date_created":"2020-07-30T09:18:30Z","department":[{"_id":"63"},{"_id":"26"}],"type":"book"},{"place":"Paderborn","date_created":"2020-08-05T09:36:46Z","type":"conference","department":[{"_id":"63"},{"_id":"26"}],"publication":"New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium","citation":{"apa":"Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &#38; Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 225–234.","ieee":"M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, and K. Volbert, “Directional Communication in Mobile Ad Hoc Networks,” in <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 2006, pp. 225–234.","short":"M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, K. Volbert, in: New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 225–234.","chicago":"Grünewald, Matthias, Friedhelm Meyer auf der Heide, Stefan Rührup, Christian Schindelhauer, and Klaus Volbert. “Directional Communication in Mobile Ad Hoc Networks.” In <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 225–34. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","mla":"Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.” <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006, pp. 225–34.","ama":"Grünewald M, Meyer auf der Heide F, Rührup S, Schindelhauer C, Volbert K. Directional Communication in Mobile Ad Hoc Networks. In: <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006:225-234.","bibtex":"@inproceedings{Grünewald_Meyer auf der Heide_Rührup_Schindelhauer_Volbert_2006, place={Paderborn}, title={Directional Communication in Mobile Ad Hoc Networks}, booktitle={New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2006}, pages={225–234} }"},"page":"225-234","_id":"17619","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"15415","status":"public","title":"Directional Communication in Mobile Ad Hoc Networks","year":"2006","author":[{"first_name":"Matthias","last_name":"Grünewald","full_name":"Grünewald, Matthias"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"}],"date_updated":"2022-01-06T06:53:16Z"},{"year":"2006","status":"public","title":"Computing Clustering Coefficients in Data Streams","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"},{"last_name":"Marchetti-Spaccamela","first_name":"Alberto","full_name":"Marchetti-Spaccamela, Alberto"},{"last_name":"Leonardi","first_name":"Stefano","full_name":"Leonardi, Stefano"},{"full_name":"Buriol, Luciana","last_name":"Buriol","first_name":"Luciana"}],"date_updated":"2022-01-06T06:53:50Z","language":[{"iso":"eng"}],"_id":"18676","user_id":"15415","publication":"Proceedings of  the European Conference on Complex Systems (ECCS'06)","citation":{"apa":"Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &#38; Buriol, L. (2006). Computing Clustering Coefficients in Data Streams. In <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>.","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Computing Clustering Coefficients in Data Streams,” in <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of  the European Conference on Complex Systems (ECCS’06), 2006.","chicago":"Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Computing Clustering Coefficients in Data Streams.” In <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","mla":"Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.” <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","ama":"Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Computing Clustering Coefficients in Data Streams. In: <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>. ; 2006.","bibtex":"@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006, title={Computing Clustering Coefficients in Data Streams}, booktitle={Proceedings of  the European Conference on Complex Systems (ECCS’06)}, author={Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, year={2006} }"},"abstract":[{"text":"We present random sampling algorithms that with probability at least 1 - δ compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv ity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the number of occurences of fixed constant-size subgraphs. Our a lgorithms only require one pass over the input stream and their storage space depends only on structural parameters of the graphs, the approxi- mation guarantee, and the confidence probability. For examp le, the algorithms to compute the clustering and transitivity coefficient depend on that coefficient but n ot on the size of the graph. Since many large social networks have small clustering and transitivity coe fficient, our algorithms use space independent of the size of the input for these graphs. We implemented our algorithms and evaluated their performance on networks from different appli- cation domains. The sizes of the considered input graphs varied from about 8, 000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion edges. For both algorithms we run experiments with a sample set size varying from 100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee. Our algorithms appear to be time efficient for the se sample sizes.","lang":"eng"}],"date_created":"2020-08-31T08:25:01Z","type":"conference","department":[{"_id":"63"}]},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-01T10:34:00Z","citation":{"ama":"Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Counting Triangles in Data Streams. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), ed. ; 2006.","bibtex":"@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006, title={Counting Triangles in Data Streams}, author={Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, editor={Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)Editor}, year={2006} }","mla":"Sohler, Christian, et al. <i>Counting Triangles in Data Streams</i>. Edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.","chicago":"Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Counting Triangles in Data Streams.” edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.), 2006.","apa":"Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &#38; Buriol, L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.).","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Counting Triangles in Data Streams,” 2006."},"user_id":"15415","language":[{"iso":"eng"}],"_id":"18745","date_updated":"2022-01-06T06:53:51Z","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Frahling, Gereon","first_name":"Gereon","last_name":"Frahling"},{"last_name":"Marchetti-Spaccamela","first_name":"Alberto","full_name":"Marchetti-Spaccamela, Alberto"},{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"last_name":"Buriol","first_name":"Luciana","full_name":"Buriol, Luciana"}],"corporate_editor":["Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)"],"year":"2006","status":"public","title":"Counting Triangles in Data Streams"},{"_id":"18746","language":[{"iso":"eng"}],"user_id":"15415","title":"A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem","status":"public","year":"2006","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"}],"date_updated":"2022-01-06T06:53:51Z","date_created":"2020-09-01T10:38:29Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","citation":{"mla":"Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","bibtex":"@inproceedings{Sohler_Gehweiler_Lammersen_2006, title={A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}, booktitle={Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}, year={2006} }","ama":"Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In: <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2006.","ieee":"C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem,” in <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","apa":"Sohler, C., Gehweiler, J., &#38; Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.","short":"C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.","chicago":"Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006."},"abstract":[{"text":"In this paper, we present a randomized constant factor approximation\r\nalgorithm for the metric minimum facility location problem with uniform\r\ncosts and demands in a distributed setting, in which every point can\r\nopen a facility. In particular, our distributed algorithm uses three\r\ncommunication rounds with message sizes bounded to O(log n) bits where\r\nn is the number of points. We also extend our algorithm to constant\r\npowers of metric spaces, where we also obtain a randomized constant\r\nfactor approximation algorithm.","lang":"eng"}]},{"author":[{"full_name":"Dynia, Miroslaw","first_name":"Miroslaw","last_name":"Dynia"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"isbn":["9783540327653","9783540327660"],"issn":["0302-9743","1611-3349"]},"status":"public","title":"Power-Aware Collective Tree Exploration","year":"2006","publication_status":"published","date_updated":"2022-01-06T06:53:54Z","_id":"18926","language":[{"iso":"eng"}],"page":"341--351","user_id":"15415","doi":"10.1007/11682127_24","citation":{"short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.","chicago":"Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.” In <i>Architecture of Computing Systems - ARCS</i>, 341--351, 2006. <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>.","apa":"Dynia, M., Korzeniowski, M., &#38; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In <i>Architecture of Computing Systems - ARCS</i> (pp. 341--351). <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>","ieee":"M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in <i>Architecture of Computing Systems - ARCS</i>, 2006, no. 3894, pp. 341--351.","ama":"Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: <i>Architecture of Computing Systems - ARCS</i>. ; 2006:341--351. doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>","bibtex":"@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware Collective Tree Exploration}, DOI={<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>}, number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006}, pages={341--351} }","mla":"Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” <i>Architecture of Computing Systems - ARCS</i>, no. 3894, 2006, pp. 341--351, doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>."},"issue":"3894","publication":"Architecture of Computing Systems - ARCS","date_created":"2020-09-03T10:13:56Z","department":[{"_id":"63"}],"type":"conference"},{"date_created":"2020-09-04T06:47:03Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"citation":{"ieee":"V. Damerow, <i>Average and Smoothed Complexity of Geometric Structures</i>, vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Damerow, V. (2006). <i>Average and Smoothed Complexity of Geometric Structures</i> (Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Damerow, Valentina. <i>Average and Smoothed Complexity of Geometric Structures</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","bibtex":"@book{Damerow_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Average and Smoothed Complexity of Geometric Structures}, volume={190}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Damerow, Valentina}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Damerow, Valentina. <i>Average and Smoothed Complexity of Geometric Structures</i>. Vol. 190. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Damerow V. <i>Average and Smoothed Complexity of Geometric Structures</i>. Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006."},"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210"}]},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18972","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":190,"status":"public","year":"2006","title":"Average and Smoothed Complexity of Geometric Structures","author":[{"last_name":"Damerow","first_name":"Valentina","full_name":"Damerow, Valentina"}],"publication_identifier":{"isbn":["3-939350-09-5"]},"date_updated":"2022-01-06T06:53:56Z","intvolume":"       190"},{"user_id":"15415","page":"1-14","_id":"18999","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:56Z","status":"public","title":"A Web Computing Environment for Parallel Algorithms in Java","year":"2006","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-04T09:50:01Z","abstract":[{"lang":"eng","text":"We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform- independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.\r\nAs the unused computation power of the participating PCs is unpredictable, we need novel strategies for load balancing that have no access to future changes of the computation power available for the application. We develop, analyze, and compare different load balancing strategies for PUBWCL. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\nDuring our evaluation of the load balancing algorithms we simulated the external work load in order to have repeatable testing conditions. With the best performing load balancing strategy we could save 39% of the execution time on average and even up to 50% in particular cases, in our test environment.\r\n"}],"publication":"Journal on Scalable Computing: Practice and Experience","citation":{"bibtex":"@inproceedings{Bonorden_Meyer auf der Heide_Gehweiler_2006, title={A Web Computing Environment for Parallel Algorithms in Java}, booktitle={Journal on Scalable Computing: Practice and Experience}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Gehweiler, Joachim}, year={2006}, pages={1–14} }","short":"O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.","ama":"Bonorden O, Meyer auf der Heide F, Gehweiler J. A Web Computing Environment for Parallel Algorithms in Java. In: <i>Journal on Scalable Computing: Practice and Experience</i>. ; 2006:1-14.","chicago":"Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Joachim Gehweiler. “A Web Computing Environment for Parallel Algorithms in Java.” In <i>Journal on Scalable Computing: Practice and Experience</i>, 1–14, 2006.","ieee":"O. Bonorden, F. Meyer auf der Heide, and J. Gehweiler, “A Web Computing Environment for Parallel Algorithms in Java,” in <i>Journal on Scalable Computing: Practice and Experience</i>, 2006, pp. 1–14.","apa":"Bonorden, O., Meyer auf der Heide, F., &#38; Gehweiler, J. (2006). A Web Computing Environment for Parallel Algorithms in Java. In <i>Journal on Scalable Computing: Practice and Experience</i> (pp. 1–14).","mla":"Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” <i>Journal on Scalable Computing: Practice and Experience</i>, 2006, pp. 1–14."}},{"date_created":"2020-09-04T09:56:41Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","citation":{"ieee":"J. Gehweiler and G. Schomaker, “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries,” in <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>, 2006, pp. 51–58.","apa":"Gehweiler, J., &#38; Schomaker, G. (2006). Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i> (pp. 51–58). <a href=\"https://doi.org/10.1109/ds-rt.2006.15\">https://doi.org/10.1109/ds-rt.2006.15</a>","chicago":"Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” In <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>, 51–58, 2006. <a href=\"https://doi.org/10.1109/ds-rt.2006.15\">https://doi.org/10.1109/ds-rt.2006.15</a>.","short":"J. Gehweiler, G. Schomaker, in: Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58.","mla":"Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>, 2006, pp. 51–58, doi:<a href=\"https://doi.org/10.1109/ds-rt.2006.15\">10.1109/ds-rt.2006.15</a>.","bibtex":"@inproceedings{Gehweiler_Schomaker_2006, title={Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}, DOI={<a href=\"https://doi.org/10.1109/ds-rt.2006.15\">10.1109/ds-rt.2006.15</a>}, booktitle={Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)}, author={Gehweiler, Joachim and Schomaker, Gunnar}, year={2006}, pages={51–58} }","ama":"Gehweiler J, Schomaker G. Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In: <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>. ; 2006:51-58. doi:<a href=\"https://doi.org/10.1109/ds-rt.2006.15\">10.1109/ds-rt.2006.15</a>"},"abstract":[{"text":"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.\r\n","lang":"eng"}],"page":"51-58","language":[{"iso":"eng"}],"_id":"19001","doi":"10.1109/ds-rt.2006.15","user_id":"15415","title":"Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries","year":"2006","status":"public","publication_identifier":{"isbn":["0769526977"]},"author":[{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"},{"full_name":"Schomaker, Gunnar","last_name":"Schomaker","first_name":"Gunnar"}],"date_updated":"2022-01-06T06:53:57Z","publication_status":"published"},{"doi":"10.1016/j.dam.2005.05.037","user_id":"15415","_id":"23881","language":[{"iso":"eng"}],"page":"1380-1391","date_updated":"2022-01-06T06:56:02Z","publication_status":"published","author":[{"full_name":"Faigle, Ulrich","first_name":"Ulrich","last_name":"Faigle"},{"full_name":"Frahling, Gereon","first_name":"Gereon","last_name":"Frahling"}],"publication_identifier":{"issn":["0166-218X"]},"year":"2006","title":"A combinatorial algorithm for weighted stable sets in bipartite graphs","status":"public","department":[{"_id":"63"}],"type":"journal_article","date_created":"2021-09-07T12:54:05Z","abstract":[{"lang":"eng","text":"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."}],"citation":{"ieee":"U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable sets in bipartite graphs,” <i>Discrete Applied Mathematics</i>, pp. 1380–1391, 2006.","apa":"Faigle, U., &#38; Frahling, G. (2006). A combinatorial algorithm for weighted stable sets in bipartite graphs. <i>Discrete Applied Mathematics</i>, 1380–1391. <a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">https://doi.org/10.1016/j.dam.2005.05.037</a>","short":"U. Faigle, G. Frahling, Discrete Applied Mathematics (2006) 1380–1391.","chicago":"Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.” <i>Discrete Applied Mathematics</i>, 2006, 1380–91. <a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">https://doi.org/10.1016/j.dam.2005.05.037</a>.","mla":"Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.” <i>Discrete Applied Mathematics</i>, 2006, pp. 1380–91, doi:<a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">10.1016/j.dam.2005.05.037</a>.","bibtex":"@article{Faigle_Frahling_2006, title={A combinatorial algorithm for weighted stable sets in bipartite graphs}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">10.1016/j.dam.2005.05.037</a>}, journal={Discrete Applied Mathematics}, author={Faigle, Ulrich and Frahling, Gereon}, year={2006}, pages={1380–1391} }","ama":"Faigle U, Frahling G. A combinatorial algorithm for weighted stable sets in bipartite graphs. <i>Discrete Applied Mathematics</i>. 2006:1380-1391. doi:<a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">10.1016/j.dam.2005.05.037</a>"},"publication":"Discrete Applied Mathematics"},{"language":[{"iso":"eng"}],"_id":"23882","user_id":"15415","doi":"10.1145/1137856.1137879","status":"public","title":"A fast k-means implementation using coresets","year":"2006","author":[{"full_name":"Frahling, Gereon","first_name":"Gereon","last_name":"Frahling"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"publication_status":"published","date_updated":"2022-01-06T06:56:02Z","date_created":"2021-09-07T13:03:31Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the twenty-second annual symposium on Computational geometry  - SCG '06","citation":{"mla":"Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.” <i>Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06</i>, 2006, doi:<a href=\"https://doi.org/10.1145/1137856.1137879\">10.1145/1137856.1137879</a>.","bibtex":"@inproceedings{Frahling_Sohler_2006, title={A fast k-means implementation using coresets}, DOI={<a href=\"https://doi.org/10.1145/1137856.1137879\">10.1145/1137856.1137879</a>}, booktitle={Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06}, author={Frahling, Gereon and Sohler, Christian}, year={2006} }","ama":"Frahling G, Sohler C. A fast k-means implementation using coresets. In: <i>Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06</i>. ; 2006. doi:<a href=\"https://doi.org/10.1145/1137856.1137879\">10.1145/1137856.1137879</a>","ieee":"G. Frahling and C. Sohler, “A fast k-means implementation using coresets,” in <i>Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06</i>, 2006.","apa":"Frahling, G., &#38; Sohler, C. (2006). A fast k-means implementation using coresets. In <i>Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06</i>. <a href=\"https://doi.org/10.1145/1137856.1137879\">https://doi.org/10.1145/1137856.1137879</a>","short":"G. Frahling, C. Sohler, in: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006.","chicago":"Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.” In <i>Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06</i>, 2006. <a href=\"https://doi.org/10.1145/1137856.1137879\">https://doi.org/10.1145/1137856.1137879</a>."},"abstract":[{"text":"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.","lang":"eng"}]},{"citation":{"mla":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>. 2006.","apa":"Hamann, H. (2006). <i>Modeling and Investigation of Robot Swarms</i>.","ieee":"H. Hamann, <i>Modeling and Investigation of Robot Swarms</i>. 2006.","short":"H. Hamann, Modeling and Investigation of Robot Swarms, 2006.","ama":"Hamann H. <i>Modeling and Investigation of Robot Swarms</i>.; 2006.","chicago":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>, 2006.","bibtex":"@book{Hamann_2006, title={Modeling and Investigation of Robot Swarms}, author={Hamann, Heiko}, year={2006} }"},"date_created":"2020-11-19T12:18:36Z","type":"mastersthesis","department":[{"_id":"63"},{"_id":"238"}],"title":"Modeling and Investigation of Robot Swarms","year":"2006","status":"public","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"date_updated":"2022-01-06T06:54:27Z","_id":"20436","language":[{"iso":"eng"}],"user_id":"15415"},{"date_updated":"2022-01-06T06:53:24Z","publication_status":"published","title":"Geometric spanners with applications in wireless networks","status":"public","year":"2006","publication_identifier":{"issn":["0925-7721"]},"author":[{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"full_name":"Volbert, Klaus","last_name":"Volbert","first_name":"Klaus"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"doi":"10.1016/j.comgeo.2006.02.001","user_id":"15415","page":"197-214","_id":"17979","language":[{"iso":"eng"}],"publication":"Computational Geometry","citation":{"short":"C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214.","chicago":"Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Geometric Spanners with Applications in Wireless Networks.” <i>Computational Geometry</i>, 2006, 197–214. <a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">https://doi.org/10.1016/j.comgeo.2006.02.001</a>.","apa":"Schindelhauer, C., Volbert, K., &#38; Ziegler, M. (2006). Geometric spanners with applications in wireless networks. <i>Computational Geometry</i>, 197–214. <a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">https://doi.org/10.1016/j.comgeo.2006.02.001</a>","ieee":"C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” <i>Computational Geometry</i>, pp. 197–214, 2006.","ama":"Schindelhauer C, Volbert K, Ziegler M. Geometric spanners with applications in wireless networks. <i>Computational Geometry</i>. 2006:197-214. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">10.1016/j.comgeo.2006.02.001</a>","bibtex":"@article{Schindelhauer_Volbert_Ziegler_2006, title={Geometric spanners with applications in wireless networks}, DOI={<a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">10.1016/j.comgeo.2006.02.001</a>}, journal={Computational Geometry}, author={Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, year={2006}, pages={197–214} }","mla":"Schindelhauer, Christian, et al. “Geometric Spanners with Applications in Wireless Networks.” <i>Computational Geometry</i>, 2006, pp. 197–214, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">10.1016/j.comgeo.2006.02.001</a>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-08-14T13:26:24Z"},{"publication":"Journal of Complexity","citation":{"ama":"Ziegler M. Effectively open real functions. <i>Journal of Complexity</i>. 2006:827-849. doi:<a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">10.1016/j.jco.2006.05.002</a>","bibtex":"@article{Ziegler_2006, title={Effectively open real functions}, DOI={<a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">10.1016/j.jco.2006.05.002</a>}, journal={Journal of Complexity}, author={Ziegler, Martin}, year={2006}, pages={827–849} }","mla":"Ziegler, Martin. “Effectively Open Real Functions.” <i>Journal of Complexity</i>, 2006, pp. 827–49, doi:<a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">10.1016/j.jco.2006.05.002</a>.","short":"M. Ziegler, Journal of Complexity (2006) 827–849.","chicago":"Ziegler, Martin. “Effectively Open Real Functions.” <i>Journal of Complexity</i>, 2006, 827–49. <a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">https://doi.org/10.1016/j.jco.2006.05.002</a>.","apa":"Ziegler, M. (2006). Effectively open real functions. <i>Journal of Complexity</i>, 827–849. <a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">https://doi.org/10.1016/j.jco.2006.05.002</a>","ieee":"M. Ziegler, “Effectively open real functions,” <i>Journal of Complexity</i>, pp. 827–849, 2006."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-08-14T13:40:13Z","publication_status":"published","date_updated":"2022-01-06T06:53:24Z","title":"Effectively open real functions","year":"2006","status":"public","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"publication_identifier":{"issn":["0885-064X"]},"user_id":"15415","doi":"10.1016/j.jco.2006.05.002","page":"827-849","language":[{"iso":"eng"}],"_id":"17985"},{"user_id":"15415","doi":"10.1007/11780342_39","_id":"17987","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:24Z","publication_identifier":{"isbn":["9783540354666","9783540354680"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Meer, Klaus","last_name":"Meer","first_name":"Klaus"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"title":"Uncomputability Below the Real Halting Problem","status":"public","year":"2006","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-08-14T13:43:09Z","place":"Berlin, Heidelberg","citation":{"bibtex":"@inbook{Meer_Ziegler_2006, place={Berlin, Heidelberg}, title={Uncomputability Below the Real Halting Problem}, DOI={<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>}, booktitle={Logical Approaches to Computational Barriers}, author={Meer, Klaus and Ziegler, Martin}, year={2006} }","ama":"Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>","mla":"Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” <i>Logical Approaches to Computational Barriers</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>.","short":"K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.","chicago":"Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” In <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11780342_39\">https://doi.org/10.1007/11780342_39</a>.","ieee":"K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in <i>Logical Approaches to Computational Barriers</i>, Berlin, Heidelberg, 2006.","apa":"Meer, K., &#38; Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11780342_39\">https://doi.org/10.1007/11780342_39</a>"},"publication":"Logical Approaches to Computational Barriers"},{"user_id":"15415","page":"79-88","_id":"18351","publisher":"SCS European Publishing House","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:29Z","status":"public","year":"2006","title":"d³FACT insight goes parallel - Aggregation of multiple simulations","author":[{"full_name":"Dangelmaier, Wilhelm ","first_name":"Wilhelm ","last_name":"Dangelmaier"},{"last_name":"Huber","first_name":"Daniel ","full_name":"Huber, Daniel "},{"full_name":"Laroque, Christoph ","last_name":"Laroque","first_name":"Christoph "},{"full_name":"Aufenanger, Mark","first_name":"Mark","last_name":"Aufenanger"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Krokowski","first_name":"Jens","full_name":"Krokowski, Jens"},{"full_name":"Kortenjan, Michael","first_name":"Michael","last_name":"Kortenjan"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-26T09:48:35Z","abstract":[{"text":"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.","lang":"eng"}],"publication":"Simulation and Visualization 2006 (SimViS)","citation":{"ama":"Dangelmaier W, Huber D, Laroque C, et al. d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations. In: <i>Simulation and Visualization 2006 (SimViS)</i>. SCS European Publishing House; 2006:79-88.","bibtex":"@inproceedings{Dangelmaier_Huber_Laroque_Aufenanger_Fischer_Krokowski_Kortenjan_2006, title={d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations}, booktitle={Simulation and Visualization 2006 (SimViS)}, publisher={SCS European Publishing House}, author={Dangelmaier, Wilhelm  and Huber, Daniel  and Laroque, Christoph  and Aufenanger, Mark and Fischer, Matthias and Krokowski, Jens and Kortenjan, Michael}, year={2006}, pages={79–88} }","mla":"Dangelmaier, Wilhelm, et al. “D<sup>3</sup>FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” <i>Simulation and Visualization 2006 (SimViS)</i>, SCS European Publishing House, 2006, pp. 79–88.","chicago":"Dangelmaier, Wilhelm , Daniel  Huber, Christoph  Laroque, Mark Aufenanger, Matthias Fischer, Jens Krokowski, and Michael Kortenjan. “D<sup>3</sup>FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” In <i>Simulation and Visualization 2006 (SimViS)</i>, 79–88. SCS European Publishing House, 2006.","short":"W. Dangelmaier, D. Huber, C. Laroque, M. Aufenanger, M. Fischer, J. Krokowski, M. Kortenjan, in: Simulation and Visualization 2006 (SimViS), SCS European Publishing House, 2006, pp. 79–88.","apa":"Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski, J., &#38; Kortenjan, M. (2006). d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations. In <i>Simulation and Visualization 2006 (SimViS)</i> (pp. 79–88). SCS European Publishing House.","ieee":"W. Dangelmaier <i>et al.</i>, “d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations,” in <i>Simulation and Visualization 2006 (SimViS)</i>, 2006, pp. 79–88."}}]