--- _id: '19836' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Kerstin full_name: Voß, Kerstin last_name: Voß citation: ama: 'Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005). 3738. ; 2005:271-284. doi:10.1007/11561354_23' apa: Schindelhauer, C., & Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) (pp. 271–284). https://doi.org/10.1007/11561354_23 bibtex: '@inbook{Schindelhauer_Voß_2005, series={3738}, title={Probability Distributions for Channel Utilisation}, DOI={10.1007/11561354_23}, booktitle={Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)}, author={Schindelhauer, Christian and Voß, Kerstin}, year={2005}, pages={271–284}, collection={3738} }' chicago: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 271–84. 3738, 2005. https://doi.org/10.1007/11561354_23. ieee: C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284. mla: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23. short: 'C. Schindelhauer, K. Voß, in: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.' date_created: 2020-10-01T11:36:30Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_23 language: - iso: eng page: 271-284 publication: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: '3738' status: public title: Probability Distributions for Channel Utilisation type: book_chapter user_id: '15415' year: '2005' ... --- _id: '19837' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Gerhard full_name: Weikum, Gerhard last_name: Weikum - first_name: David full_name: Hales, David last_name: Hales - first_name: Peter full_name: Triantafillou, Peter last_name: Triantafillou citation: ama: 'Schindelhauer C, Weikum G, Hales D, Triantafillou P. Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In: European Conference on Complex Systems (ECCS 2005). ; 2005.' apa: Schindelhauer, C., Weikum, G., Hales, D., & Triantafillou, P. (2005). Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In European Conference on Complex Systems (ECCS 2005). bibtex: '@inproceedings{Schindelhauer_Weikum_Hales_Triantafillou_2005, title={Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}, booktitle={European Conference on Complex Systems (ECCS 2005)}, author={Schindelhauer, Christian and Weikum, Gerhard and Hales, David and Triantafillou, Peter}, year={2005} }' chicago: Schindelhauer, Christian, Gerhard Weikum, David Hales, and Peter Triantafillou. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” In European Conference on Complex Systems (ECCS 2005), 2005. ieee: C. Schindelhauer, G. Weikum, D. Hales, and P. Triantafillou, “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search,” in European Conference on Complex Systems (ECCS 2005), 2005. mla: Schindelhauer, Christian, et al. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” European Conference on Complex Systems (ECCS 2005), 2005. short: 'C. Schindelhauer, G. Weikum, D. Hales, P. Triantafillou, in: European Conference on Complex Systems (ECCS 2005), 2005.' date_created: 2020-10-01T11:45:28Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng publication: European Conference on Complex Systems (ECCS 2005) status: public title: Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search type: conference user_id: '15415' year: '2005' ... --- _id: '19871' abstract: - lang: eng text: Data has become the most valuable asset for many companies; loosing important data can cause companies to fail quite immediately. The protection of data inside storage systems is mostly achieved by using a RAID scheme that adds redundant data to user data, enabling recovery from single or multiple disk failures. This protection against data loss in case of a disk failure can be achieved either by dedicated hardware or a software RAID solution.

One major advantage of software RAID is that it comes for free as a built-in functionality in many operating systems like Linux or Microsoft Windows. The drawback of the built-in functionality is that it is not suited to run in multiple server environments; synchronization and recovery processes can be corrupted if more than a single server is allowed to access a software RAID volume.

In this paper, we present an enhancement for the Linux md-driver that enables a consistent usage of RAID in multiple server environments. Based on the V:DRIVE virtualization environment, RAID volumes can be consistently synchronized and recovered even in distributed environments. Besides the architectural concepts, we present measurements that indicate the viability of this enhanced, distributed version of md. author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Distributed MD. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os. ; 2005:81-88.' apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2005). Distributed MD. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 81–88). bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2005, title={Distributed MD}, booktitle={In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, author={Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2005}, pages={81–88} }' chicago: Brinkmann, André, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Distributed MD.” In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 81–88, 2005. ieee: A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Distributed MD,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88. mla: Brinkmann, André, et al. “Distributed MD.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88.' date_created: 2020-10-05T08:49:22Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' language: - iso: eng page: 81 - 88 publication: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os status: public title: Distributed MD type: conference user_id: '15415' year: '2005' ... --- _id: '19872' abstract: - lang: eng text: "Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in \x94closed loop\x94 approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tool\x92s architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tool\x92s architecture." author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Henning full_name: Baars, Henning last_name: Baars citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M, Baars H. An integrated Architecture for Business Intelligence support from Application down to Storage. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os. ; 2005:1-8.' apa: Brinkmann, A., Effert, S., Heidebuer, M., Vodisek, M., & Baars, H. (2005). An integrated Architecture for Business Intelligence support from Application down to Storage. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 1–8). bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_Baars_2005, title={An integrated Architecture for Business Intelligence support from Application down to Storage}, booktitle={In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, author={Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario and Baars, Henning}, year={2005}, pages={1–8} }' chicago: Brinkmann, André, Sascha Effert, Michael Heidebuer, Mario Vodisek, and Henning Baars. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 1–8, 2005. ieee: A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, and H. Baars, “An integrated Architecture for Business Intelligence support from Application down to Storage,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8. mla: Brinkmann, André, et al. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, H. Baars, in: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8.' date_created: 2020-10-05T08:56:38Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' language: - iso: eng page: 1-8 publication: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os status: public title: An integrated Architecture for Business Intelligence support from Application down to Storage type: conference user_id: '15415' year: '2005' ... --- _id: '19888' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. The expected running time of hierarchical collision detection. In: ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05. ; 2005. doi:10.1145/1186954.1187087' apa: Klein, J., & Zachmann, G. (2005). The expected running time of hierarchical collision detection. In ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05. https://doi.org/10.1145/1186954.1187087 bibtex: '@inproceedings{Klein_Zachmann_2005, title={The expected running time of hierarchical collision detection}, DOI={10.1145/1186954.1187087}, booktitle={ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05}, author={Klein, Jan and Zachmann, Gabriel}, year={2005} }' chicago: Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.” In ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005. https://doi.org/10.1145/1186954.1187087. ieee: J. Klein and G. Zachmann, “The expected running time of hierarchical collision detection,” in ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005. mla: Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.” ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005, doi:10.1145/1186954.1187087. short: 'J. Klein, G. Zachmann, in: ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005.' date_created: 2020-10-05T13:25:41Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1186954.1187087 language: - iso: eng publication: ACM SIGGRAPH 2005 Posters on - SIGGRAPH '05 publication_status: published status: public title: The expected running time of hierarchical collision detection type: conference user_id: '15415' year: '2005' ... --- _id: '19890' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. Interpolation Search for Point Cloud Intersection. In: Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005). ; 2005:163-170. doi:10.1145/1186223.1186329' apa: Klein, J., & Zachmann, G. (2005). Interpolation Search for Point Cloud Intersection. In Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005) (pp. 163–170). https://doi.org/10.1145/1186223.1186329 bibtex: '@inproceedings{Klein_Zachmann_2005, title={Interpolation Search for Point Cloud Intersection}, DOI={10.1145/1186223.1186329}, booktitle={Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005)}, author={Klein, Jan and Zachmann, Gabriel}, year={2005}, pages={163–170} }' chicago: Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.” In Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 163–70, 2005. https://doi.org/10.1145/1186223.1186329. ieee: J. Klein and G. Zachmann, “Interpolation Search for Point Cloud Intersection,” in Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170. mla: Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.” Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–70, doi:10.1145/1186223.1186329. short: 'J. Klein, G. Zachmann, in: Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170.' date_created: 2020-10-05T13:38:33Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1186223.1186329 language: - iso: eng page: 163-170 publication: Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2005 (WSCG'2005) status: public title: Interpolation Search for Point Cloud Intersection type: conference user_id: '15415' year: '2005' ... --- _id: '19912' author: - first_name: Chris full_name: Loeser, Chris last_name: Loeser - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer citation: ama: 'Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In: Proceedings of the 4th International Conference on Networking. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:10.1007/978-3-540-31957-3_90' apa: Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., & Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_90 bibtex: '@inproceedings{Loeser_Schomaker_Brinkmann_Vodisek_Heidebuer_2005, place={Berlin, Heidelberg}, title={Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}, volume={3421}, DOI={10.1007/978-3-540-31957-3_90}, booktitle={Proceedings of the 4th International Conference on Networking}, author={Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}, year={2005}, pages={800–810} }' chicago: Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” In Proceedings of the 4th International Conference on Networking, 3421:800–810. Berlin, Heidelberg, 2005. https://doi.org/10.1007/978-3-540-31957-3_90. ieee: C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810. mla: Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90. short: 'C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, M. Heidebuer, in: Proceedings of the 4th International Conference on Networking, Berlin, Heidelberg, 2005, pp. 800–810.' date_created: 2020-10-06T10:36:14Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' doi: 10.1007/978-3-540-31957-3_90 intvolume: ' 3421' language: - iso: eng page: 800-810 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253389' - '9783540319573' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts type: conference user_id: '15415' volume: 3421 year: '2005' ... --- _id: '26278' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Benno full_name: Fuchssteiner, Benno last_name: Fuchssteiner citation: ama: Ziegler M, Fuchssteiner B. Nonlinear Reformulation of Heisenberg’s Dynamics. International Journal of Theoretical Physics. Published online 2005:693-717. doi:10.1007/s10773-005-7048-9 apa: Ziegler, M., & Fuchssteiner, B. (2005). Nonlinear Reformulation of Heisenberg’s Dynamics. International Journal of Theoretical Physics, 693–717. https://doi.org/10.1007/s10773-005-7048-9 bibtex: '@article{Ziegler_Fuchssteiner_2005, title={Nonlinear Reformulation of Heisenberg’s Dynamics}, DOI={10.1007/s10773-005-7048-9}, journal={International Journal of Theoretical Physics}, author={Ziegler, Martin and Fuchssteiner, Benno}, year={2005}, pages={693–717} }' chicago: Ziegler, Martin, and Benno Fuchssteiner. “Nonlinear Reformulation of Heisenberg’s Dynamics.” International Journal of Theoretical Physics, 2005, 693–717. https://doi.org/10.1007/s10773-005-7048-9. ieee: 'M. Ziegler and B. Fuchssteiner, “Nonlinear Reformulation of Heisenberg’s Dynamics,” International Journal of Theoretical Physics, pp. 693–717, 2005, doi: 10.1007/s10773-005-7048-9.' mla: Ziegler, Martin, and Benno Fuchssteiner. “Nonlinear Reformulation of Heisenberg’s Dynamics.” International Journal of Theoretical Physics, 2005, pp. 693–717, doi:10.1007/s10773-005-7048-9. short: M. Ziegler, B. Fuchssteiner, International Journal of Theoretical Physics (2005) 693–717. date_created: 2021-10-15T12:29:17Z date_updated: 2022-01-06T06:57:18Z department: - _id: '63' - _id: '26' doi: 10.1007/s10773-005-7048-9 language: - iso: eng page: 693-717 publication: International Journal of Theoretical Physics publication_identifier: issn: - 0020-7748 - 1572-9575 publication_status: published status: public title: Nonlinear Reformulation of Heisenberg's Dynamics type: journal_article user_id: '15415' year: '2005' ... --- _id: '28987' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Schindelhauer C, Schomaker G. Weighted distributed hash tables. In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA. ; 2005. doi:10.1145/1073970.1074008' apa: 'Schindelhauer, C., & Schomaker, G. (2005). Weighted distributed hash tables. SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA. https://doi.org/10.1145/1073970.1074008' bibtex: '@inproceedings{Schindelhauer_Schomaker_2005, title={Weighted distributed hash tables}, DOI={10.1145/1073970.1074008}, booktitle={SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA}, author={Schindelhauer, Christian and Schomaker, Gunnar}, year={2005} }' chicago: 'Schindelhauer, Christian, and Gunnar Schomaker. “Weighted Distributed Hash Tables.” In SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005. https://doi.org/10.1145/1073970.1074008.' ieee: 'C. Schindelhauer and G. Schomaker, “Weighted distributed hash tables,” 2005, doi: 10.1145/1073970.1074008.' mla: 'Schindelhauer, Christian, and Gunnar Schomaker. “Weighted Distributed Hash Tables.” SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005, doi:10.1145/1073970.1074008.' short: 'C. Schindelhauer, G. Schomaker, in: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005.' date_created: 2021-12-15T14:37:16Z date_updated: 2022-01-06T06:58:42Z department: - _id: '63' - _id: '26' doi: 10.1145/1073970.1074008 language: - iso: eng publication: 'SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA' status: public title: Weighted distributed hash tables type: conference user_id: '15415' year: '2005' ... --- _id: '26991' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: Algorithms – ESA 2005. ; 2005. doi:10.1007/11561071_5' apa: Rührup, S., & Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_5 bibtex: '@inbook{Rührup_Schindelhauer_2005, place={Berlin, Heidelberg}, title={Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio}, DOI={10.1007/11561071_5}, booktitle={Algorithms – ESA 2005}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” In Algorithms – ESA 2005. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11561071_5. ieee: S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005. mla: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5. short: 'S. Rührup, C. Schindelhauer, in: Algorithms – ESA 2005, Berlin, Heidelberg, 2005.' date_created: 2021-10-28T10:22:39Z date_updated: 2022-01-06T06:57:31Z department: - _id: '63' - _id: '26' doi: 10.1007/11561071_5 language: - iso: eng place: Berlin, Heidelberg publication: Algorithms – ESA 2005 publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio type: book_chapter user_id: '15415' year: '2005' ... --- _id: '17413' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: Fischer M. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Vol 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Fischer, M. (2005). Design, analysis, and evaluation of a data structure for distributed virtual environments (Vol. 164). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Fischer_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Design, analysis, and evaluation of a data structure for distributed virtual environments}, volume={164}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Vol. 164. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: M. Fischer, Design, analysis, and evaluation of a data structure for distributed virtual environments, vol. 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: M. Fischer, Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-07-27T12:01:54Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' intvolume: ' 164' language: - iso: eng publication_identifier: isbn: - 3-935433-73-5 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466-20050101109 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Design, analysis, and evaluation of a data structure for distributed virtual environments type: dissertation user_id: '5786' volume: 164 year: '2005' ... --- _id: '17414' abstract: - lang: eng text: "Nowadays companies operate in a difficult environment: the dynamics of innovations increase and product life cycles become shorter. Furthermore products and the corresponding manufacturing processes get more and more complex. Therefore, companies need new methods for the planning of manufacturing systems. One promising approach in this context is digital factory/virtual production\x97the modeling and analysis of computer models of the planned factory with the objective to reduce time and costs. For the modeling and analysis various simulation methods and programs have been developed. They are a highly valuable support for planning and visualizing the manufacturing system. But there is one major disadvantage: only experienced and long trained experts are able to operate with these programs. The graphical user interface is very complex and not intuitive to use. This results in an extensive and error-prone modeling of complex simulation models and a time-consuming interpretation of the simulation results.\r\n\r\nTo overcome these weak points, intuitive and understandable man\x96machine interfaces like augmented and virtual reality can be used. This paper describes the architecture of a system which uses the technologies of augmented and virtual reality to support the planning process of complex manufacturing systems. The proposed system assists the user in modeling, the validation of the simulation model, and the subsequent optimization of the production system. A general application of the VR- and AR-technologies and of the simulation is realized by the development of appropriate linking and integration mechanisms. For the visualization of the arising 3D-data within the VR- and AR-environments, a dedicated 3D-rendering library is used." author: - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jürgen full_name: Gausemeier, Jürgen last_name: Gausemeier - first_name: Michael full_name: Grafe, Michael last_name: Grafe - first_name: Carsten full_name: Matysczok, Carsten last_name: Matysczok - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck citation: ama: Dangelmaier W, Fischer M, Gausemeier J, Grafe M, Matysczok C, Mueck B. Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry. 2005:371-383. doi:10.1016/j.compind.2005.01.007 apa: Dangelmaier, W., Fischer, M., Gausemeier, J., Grafe, M., Matysczok, C., & Mueck, B. (2005). Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry, 371–383. https://doi.org/10.1016/j.compind.2005.01.007 bibtex: '@article{Dangelmaier_Fischer_Gausemeier_Grafe_Matysczok_Mueck_2005, title={Virtual and augmented reality support for discrete manufacturing system simulation}, DOI={10.1016/j.compind.2005.01.007}, journal={Computers in Industry}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Gausemeier, Jürgen and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt}, year={2005}, pages={371–383} }' chicago: Dangelmaier, Wilhelm, Matthias Fischer, Jürgen Gausemeier, Michael Grafe, Carsten Matysczok, and Bengt Mueck. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Computers in Industry, 2005, 371–83. https://doi.org/10.1016/j.compind.2005.01.007. ieee: W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, and B. Mueck, “Virtual and augmented reality support for discrete manufacturing system simulation,” Computers in Industry, pp. 371–383, 2005. mla: Dangelmaier, Wilhelm, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Computers in Industry, 2005, pp. 371–83, doi:10.1016/j.compind.2005.01.007. short: W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, B. Mueck, Computers in Industry (2005) 371–383. date_created: 2020-07-27T12:11:32Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1016/j.compind.2005.01.007 language: - iso: eng page: 371-383 publication: Computers in Industry publication_identifier: issn: - 0166-3615 publication_status: published status: public title: Virtual and augmented reality support for discrete manufacturing system simulation type: journal_article user_id: '15415' year: '2005' ... --- _id: '17415' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: B. full_name: Mueck, B. last_name: Mueck - first_name: K. full_name: Mahajan, K. last_name: Mahajan - first_name: M. full_name: Kortenjan, M. last_name: Kortenjan - first_name: C. full_name: Laroque, C. last_name: Laroque - first_name: W. full_name: Dangelmaier, W. last_name: Dangelmaier citation: ama: 'Fischer M, Mueck B, Mahajan K, Kortenjan M, Laroque C, Dangelmaier W. Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In: Proceedings of the Winter Simulation Conference. ; 2005. doi:10.1109/wsc.2005.1574470' apa: Fischer, M., Mueck, B., Mahajan, K., Kortenjan, M., Laroque, C., & Dangelmaier, W. (2005). Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In Proceedings of the Winter Simulation Conference. https://doi.org/10.1109/wsc.2005.1574470 bibtex: '@inproceedings{Fischer_Mueck_Mahajan_Kortenjan_Laroque_Dangelmaier_2005, title={Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations}, DOI={10.1109/wsc.2005.1574470}, booktitle={Proceedings of the Winter Simulation Conference}, author={Fischer, Matthias and Mueck, B. and Mahajan, K. and Kortenjan, M. and Laroque, C. and Dangelmaier, W.}, year={2005} }' chicago: Fischer, Matthias, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.” In Proceedings of the Winter Simulation Conference, 2005. https://doi.org/10.1109/wsc.2005.1574470. ieee: M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier, “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations,” in Proceedings of the Winter Simulation Conference, 2005. mla: Fischer, Matthias, et al. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.” Proceedings of the Winter Simulation Conference, 2005, doi:10.1109/wsc.2005.1574470. short: 'M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, W. Dangelmaier, in: Proceedings of the Winter Simulation Conference, 2005.' date_created: 2020-07-27T12:20:01Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1109/wsc.2005.1574470 language: - iso: eng publication: Proceedings of the Winter Simulation Conference publication_identifier: isbn: - '0780395190' publication_status: published status: public title: Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations type: conference user_id: '15415' year: '2005' ... --- _id: '18763' abstract: - lang: eng text: "Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs . We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension , then the property has an efficient tester.\r\n\r\nWe apply our framework to a variety of problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size.\r\n\r\nOur framework allows us to analyze all our testers in a unified way, and the obtained complexity bounds either match or improve the previously known bounds. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties." author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Sohler C. Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing. 2005;34(3):580-615. doi:10.1137/s009753970444199x apa: Czumaj, A., & Sohler, C. (2005). Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing, 34(3), 580–615. https://doi.org/10.1137/s009753970444199x bibtex: '@article{Czumaj_Sohler_2005, title={Abstract Combinatorial Programs and Efficient Property Testers}, volume={34}, DOI={10.1137/s009753970444199x}, number={3}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={580–615} }' chicago: 'Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” SIAM Journal on Computing 34, no. 3 (2005): 580–615. https://doi.org/10.1137/s009753970444199x.' ieee: A. Czumaj and C. Sohler, “Abstract Combinatorial Programs and Efficient Property Testers,” SIAM Journal on Computing, vol. 34, no. 3, pp. 580–615, 2005. mla: Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” SIAM Journal on Computing, vol. 34, no. 3, 2005, pp. 580–615, doi:10.1137/s009753970444199x. short: A. Czumaj, C. Sohler, SIAM Journal on Computing 34 (2005) 580–615. date_created: 2020-09-01T11:35:41Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1137/s009753970444199x intvolume: ' 34' issue: '3' language: - iso: eng page: 580-615 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: Abstract Combinatorial Programs and Efficient Property Testers type: journal_article user_id: '15415' volume: 34 year: '2005' ... --- _id: '18768' author: - first_name: Mihai full_name: Bădoiu, Mihai last_name: Bădoiu - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Piotr full_name: Indyk, Piotr last_name: Indyk - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Berlin, Heidelberg; 2005:866-877. doi:10.1007/11523468_70' apa: Bădoiu, M., Czumaj, A., Indyk, P., & Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg. https://doi.org/10.1007/11523468_70 bibtex: '@inproceedings{Bădoiu_Czumaj_Indyk_Sohler_2005, place={Berlin, Heidelberg}, title={Facility Location in Sublinear Time}, DOI={10.1007/11523468_70}, booktitle={Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)}, author={Bădoiu, Mihai and Czumaj, Artur and Indyk, Piotr and Sohler, Christian}, year={2005}, pages={866–877} }' chicago: Bădoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.” In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 866–77. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11523468_70. ieee: M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–877. mla: Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70. short: 'M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, in: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Berlin, Heidelberg, 2005, pp. 866–877.' date_created: 2020-09-01T11:53:19Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1007/11523468_70 language: - iso: eng page: 866-877 place: Berlin, Heidelberg publication: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) publication_identifier: isbn: - '9783540275800' - '9783540316916' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Facility Location in Sublinear Time type: conference user_id: '15415' year: '2005' ... --- _id: '18787' abstract: - lang: eng text: A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)-approximation algorithms for k-median, k-means, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), maximum spanning tree (MaxST), and average distance over dynamic geometric data streams. Our algorithms maintain a small weighted set of points (a coreset) that approximates with probability 2/3 the current point set with respect to the considered problem during the m insert/delete operations of the data stream. They use poly(ɛ −1, log m, log ∆) space and update time per insert/delete operation for constant k and dimension d. Having a coreset one only needs a fast approximation algorithm for the weighted problem to compute a solution quickly. In fact, even an exponential algorithm is sometimes feasible as its running time may still be polynomial in n. For example one can compute in poly(log n, exp(O((1+log(1/ɛ)/ɛ) d−1))) time a solution to k-median and k-means [21] where n is the size of the current point set and k and d are constants. Finding an implicit solution to MaxCut can be done in poly(log n, exp((1/ɛ) O(1))) time. For MaxST and average distance we require poly(log n, ɛ −1) time and for MaxWM we require O(n 3) time to do this. author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling citation: ama: 'Sohler C, Frahling G. Coresets in Dynamic Geometric Data Streams. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC). ; 2005:209-217.' apa: Sohler, C., & Frahling, G. (2005). Coresets in Dynamic Geometric Data Streams. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) (pp. 209–217). bibtex: '@inproceedings{Sohler_Frahling_2005, title={Coresets in Dynamic Geometric Data Streams}, booktitle={Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)}, author={Sohler, Christian and Frahling, Gereon}, year={2005}, pages={209–217} }' chicago: Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 209–17, 2005. ieee: C. Sohler and G. Frahling, “Coresets in Dynamic Geometric Data Streams,” in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217. mla: Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–17. short: 'C. Sohler, G. Frahling, in: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217.' date_created: 2020-09-01T13:49:23Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng page: 209-217 publication: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) status: public title: Coresets in Dynamic Geometric Data Streams type: conference user_id: '15415' year: '2005' ... --- _id: '18790' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Sohler C. Testing hypergraph colorability. Theoretical Computer Science. 2005;331(1):37-52. doi:10.1016/j.tcs.2004.09.031 apa: Czumaj, A., & Sohler, C. (2005). Testing hypergraph colorability. Theoretical Computer Science, 331(1), 37–52. https://doi.org/10.1016/j.tcs.2004.09.031 bibtex: '@article{Czumaj_Sohler_2005, title={Testing hypergraph colorability}, volume={331}, DOI={10.1016/j.tcs.2004.09.031}, number={1}, journal={Theoretical Computer Science}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={37–52} }' chicago: 'Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science 331, no. 1 (2005): 37–52. https://doi.org/10.1016/j.tcs.2004.09.031.' ieee: A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005. mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science, vol. 331, no. 1, 2005, pp. 37–52, doi:10.1016/j.tcs.2004.09.031. short: A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52. date_created: 2020-09-01T14:00:37Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1016/j.tcs.2004.09.031 intvolume: ' 331' issue: '1' language: - iso: eng page: 37-52 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Testing hypergraph colorability type: journal_article user_id: '15415' volume: 331 year: '2005' ... --- _id: '18855' abstract: - lang: eng text: "We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \\eps$ using only $\\widetilde{\\O}(\\sqrt{n} \\, \\text{poly} (1/\\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries.\r\n\r\n\r\nRead More: https://epubs.siam.org/doi/10.1137/S0097539703435297\r\n" author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Funda full_name: Ergün, Funda last_name: Ergün - first_name: Lance full_name: Fortnow, Lance last_name: Fortnow - first_name: Avner full_name: Magen, Avner last_name: Magen - first_name: Ilan full_name: Newman, Ilan last_name: Newman - first_name: Ronitt full_name: Rubinfeld, Ronitt last_name: Rubinfeld - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Ergün F, Fortnow L, et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 2005;35(1):91-109. doi:10.1137/s0097539703435297 apa: Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., & Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35(1), 91–109. https://doi.org/10.1137/s0097539703435297 bibtex: '@article{Czumaj_Ergün_Fortnow_Magen_Newman_Rubinfeld_Sohler_2005, title={Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}, volume={35}, DOI={10.1137/s0097539703435297}, number={1}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}, year={2005}, pages={91–109} }' chicago: 'Czumaj, Artur, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, and Christian Sohler. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing 35, no. 1 (2005): 91–109. https://doi.org/10.1137/s0097539703435297.' ieee: A. Czumaj et al., “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” SIAM Journal on Computing, vol. 35, no. 1, pp. 91–109, 2005. mla: Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing, vol. 35, no. 1, 2005, pp. 91–109, doi:10.1137/s0097539703435297. short: A. Czumaj, F. Ergün, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, C. Sohler, SIAM Journal on Computing 35 (2005) 91–109. date_created: 2020-09-02T12:13:26Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1137/s0097539703435297 intvolume: ' 35' issue: '1' language: - iso: eng page: 91-109 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time type: journal_article user_id: '15415' volume: 35 year: '2005' ... --- _id: '18867' abstract: - lang: eng text: Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.
We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well. author: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Jens full_name: Krokowski, Jens last_name: Krokowski citation: ama: 'Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67' apa: 'Frahling, G., & Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. https://doi.org/10.1007/11561071_67' bibtex: '@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={10.1007/11561071_67}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }' chicago: 'Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/11561071_67.' ieee: G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769. mla: Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67. short: 'G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.' date_created: 2020-09-02T13:26:52Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1007/11561071_67 intvolume: ' 3669' language: - iso: eng page: 758-769 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Online Occlusion Culling type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18912' abstract: - lang: eng text: 'We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg; 2005. doi:10.1007/11549468_105' apa: Bienkowski, M., & Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg. https://doi.org/10.1007/11549468_105 bibtex: '@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={10.1007/11549468_105}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }' chicago: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549468_105. ieee: M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005. mla: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105. short: 'M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.' date_created: 2020-09-03T07:56:58Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11549468_105 language: - iso: eng place: Berlin, Heidelberg publication: Proc. of the European Conference in Parallel Processing (Euro-Par) publication_identifier: isbn: - '9783540287001' - '9783540319252' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Dynamic Page Migration Under Brownian Motion type: conference user_id: '15415' year: '2005' ...