--- _id: '2124' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA. ; 2004:318--327.' apa: 'Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).' bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion deterministic data structure for distributed environments}, booktitle={SODA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327} }' chicago: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.' ieee: 'B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.' mla: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.' short: 'B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.' date_created: 2018-04-03T05:34:17Z date_updated: 2022-01-06T06:54:51Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-13T08:36:08Z date_updated: 2018-04-13T08:36:08Z file_id: '2323' file_name: SODA-04.pdf file_size: 193831 relation: main_file file_date_updated: 2018-04-13T08:36:08Z has_accepted_license: '1' oa: '1' page: 318--327 publication: SODA status: public title: 'The hyperring: a low-congestion deterministic data structure for distributed environments' type: conference urn: '21247' user_id: '15504' year: '2004' ... --- _id: '2125' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. Consistent and compact data management in distributed storage systems. In: SPAA. ; 2004:44--53.' apa: Awerbuch, B., & Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In SPAA (pp. 44--53). bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }' chicago: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In SPAA, 44--53, 2004. ieee: B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53. mla: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53. short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.' date_created: 2018-04-03T05:34:56Z date_updated: 2022-01-06T06:54:51Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:41:38Z date_updated: 2018-04-12T09:41:38Z file_id: '2315' file_name: AS-SPAA-04.pdf file_size: 170429 relation: main_file file_date_updated: 2018-04-12T09:41:38Z has_accepted_license: '1' oa: '1' page: 44--53 publication: SPAA status: public title: Consistent and compact data management in distributed storage systems type: conference urn: '21256' user_id: '15504' year: '2004' ... --- _id: '2126' author: - first_name: Ankur full_name: Bhargava, Ankur last_name: Bhargava - first_name: Kishore full_name: Kothapalli, Kishore last_name: Kothapalli - first_name: Chris full_name: Riley, Chris last_name: Riley - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Mark full_name: Thober, Mark last_name: Thober citation: ama: 'Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.' apa: 'Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).' bibtex: '@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }' chicago: 'Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler, and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” In SPAA, 170--179, 2004.' ieee: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.' mla: 'Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.' short: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.' date_created: 2018-04-03T05:35:31Z date_updated: 2022-01-06T06:54:52Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:40:12Z date_updated: 2018-04-12T09:40:42Z file_id: '2314' file_name: BKRST-SPAA-04.pdf file_size: 118175 relation: main_file file_date_updated: 2018-04-12T09:40:42Z has_accepted_license: '1' oa: '1' page: 170--179 publication: SPAA status: public title: 'Pagoda: a dynamic overlay network for routing, data management, and multicasting' type: conference urn: '21266' user_id: '15504' year: '2004' ... --- _id: '2127' author: - first_name: Amitabha full_name: Bagchi, Amitabha last_name: Bagchi - first_name: Ankur full_name: Bhargava, Ankur last_name: Bhargava - first_name: Amitabh full_name: Chaudhary, Amitabh last_name: Chaudhary - first_name: David full_name: Eppstein, David last_name: Eppstein - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293.' apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM. bibtex: '@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2004}, pages={286--293} }' chicago: Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA, 286--293. ACM, 2004. ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293. mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293. short: 'A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.' date_created: 2018-04-03T05:36:11Z date_updated: 2022-01-06T06:54:52Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:21:24Z date_updated: 2018-04-12T09:21:24Z file_id: '2313' file_name: BBCES-SPAA-04.pdf file_size: 197503 relation: main_file file_date_updated: 2018-04-12T09:21:24Z has_accepted_license: '1' oa: '1' page: 286--293 publication: SPAA publisher: ACM status: public title: The effect of faults on network expansion type: conference urn: '21276' user_id: '15504' year: '2004' ... --- _id: '17346' author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: 'Ulrich ' full_name: 'Rückert, Ulrich ' last_name: Rückert - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Heidebuer M, Meyer auf der Heide F, Rückert U, Salzwedel K, Vodisek M. V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In: Kobler B, Hariharan PC, eds. 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA. IEEE; 2004:153--157.' apa: Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., & Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler & P. C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE. bibtex: '@inproceedings{Brinkmann_Heidebuer_Meyer auf der Heide_Rückert_Salzwedel_Vodisek_2004, title={V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System}, booktitle={21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA}, publisher={IEEE}, author={Brinkmann, André and Heidebuer, Michael and Meyer auf der Heide, Friedhelm and Rückert, Ulrich and Salzwedel, Kay and Vodisek, Mario}, editor={Kobler, Ben and Hariharan, P. C.Editors}, year={2004}, pages={153--157} }' chicago: Brinkmann, André, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich Rückert, Kay Salzwedel, and Mario Vodisek. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” In 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, 153--157. IEEE, 2004. ieee: A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, and M. Vodisek, “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System,” in 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, 2004, pp. 153--157. mla: Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157. short: 'A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, M. Vodisek, in: B. Kobler, P.C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, IEEE, 2004, pp. 153--157.' date_created: 2020-06-26T13:30:51Z date_updated: 2022-01-06T06:53:08Z department: - _id: '63' editor: - first_name: Ben full_name: Kobler, Ben last_name: Kobler - first_name: P. C. full_name: Hariharan, P. C. last_name: Hariharan language: - iso: eng page: 153--157 publication: 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA publisher: IEEE status: public title: V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System type: conference user_id: '15415' year: '2004' ... --- _id: '18777' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow citation: ama: 'Sohler C, Damerow V. Smoothed Number of Extreme Points under Uniform Noise. In: Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04). ; 2004:93-96.' apa: Sohler, C., & Damerow, V. (2004). Smoothed Number of Extreme Points under Uniform Noise. In Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04) (pp. 93–96). bibtex: '@inproceedings{Sohler_Damerow_2004, title={Smoothed Number of Extreme Points under Uniform Noise}, booktitle={Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04)}, author={Sohler, Christian and Damerow, Valentina}, year={2004}, pages={93–96} }' chicago: Sohler, Christian, and Valentina Damerow. “Smoothed Number of Extreme Points under Uniform Noise.” In Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04), 93–96, 2004. ieee: C. Sohler and V. Damerow, “Smoothed Number of Extreme Points under Uniform Noise,” in Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04), 2004, pp. 93–96. mla: Sohler, Christian, and Valentina Damerow. “Smoothed Number of Extreme Points under Uniform Noise.” Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04), 2004, pp. 93–96. short: 'C. Sohler, V. Damerow, in: Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04), 2004, pp. 93–96.' date_created: 2020-09-01T12:23:21Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng page: 93 - 96 publication: Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04) status: public title: Smoothed Number of Extreme Points under Uniform Noise type: conference user_id: '15415' year: '2004' ... --- _id: '18778' abstract: - lang: eng text: Given a point set P in the d-dimensional unit hypercube, we give upper bounds on the maximal expected number of extreme points when each point is perturbed by small random noise chosen independently for each point from the same noise distribution Δ. Our results are parametrized by the variance of the noise distribution. For large variance we essentially consider the average case for distribution Δ while for variance 0 we consider the worst case. Hence our results give upper bounds on the number of extreme points where our input distributions range from average case to worst case.
Our main contribution is a rather general lemma that can be used to obtain upper bounds on the expected number of extreme points for a large class of noise distributions. We then apply this lemma to obtain explicit bounds for random noise coming from the Gaussian normal distribution of variance σ² and the uniform distribution in a hypercube of side length &epsilon. For these noise distributions we show upper bounds of O( (1/ σ )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / ε )^d/(d+1) ), respectively. Besides its theoretical motivation our model is also motivated by the observation that in many applications of convex hull algorithms the input data is inherently noisy, e.g. when the data comes from physical measurement or imprecise arithmetic is used. author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Damerow V, Sohler C. Extreme Points Under Random Noise. In: Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_25' apa: Damerow, V., & Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_25 bibtex: '@inproceedings{Damerow_Sohler_2004, place={Berlin, Heidelberg}, title={Extreme Points Under Random Noise}, DOI={10.1007/978-3-540-30140-0_25}, booktitle={Proceedings of the 12th European Symposium on Algorithms (ESA’04)}, author={Damerow, Valentina and Sohler, Christian}, year={2004} }' chicago: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30140-0_25. ieee: V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004. mla: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.” Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004, doi:10.1007/978-3-540-30140-0_25. short: 'V. Damerow, C. Sohler, in: Proceedings of the 12th European Symposium on Algorithms (ESA’04), Berlin, Heidelberg, 2004.' date_created: 2020-09-01T12:26:47Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1007/978-3-540-30140-0_25 language: - iso: eng place: Berlin, Heidelberg publication: Proceedings of the 12th European Symposium on Algorithms (ESA'04) publication_identifier: isbn: - '9783540230250' - '9783540301400' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Extreme Points Under Random Noise type: conference user_id: '15415' year: '2004' ... --- _id: '18785' abstract: - lang: eng text: A limiting factor in the performance of a render- ing system is the number of state changes, i.e., changes of the attributes material, texture, shader program, etc., in the stream of rendered primitives. We propose to include a small buffer between appli- cation and graphics hardware in the rendering sys- tem. This pipeline buffer is used to rearrange the incoming sequence of primitives on-line and locally in such a way that the number of state changes is minimized. This method is generic; it can be easily integrated into existing rendering systems. In our experiments a pipeline buffer reduces the number of state changes by an order of magnitude and achieves almost the same rendering time as an optimal, i.e., presorted, sequence without pipeline buffer. Due to its simple structure and its low mem- ory requirements this method can easily be imple- mented in software or even hardware. author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Jens full_name: Krokowski, Jens last_name: Krokowski - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Matthias full_name: Westermann, Matthias last_name: Westermann citation: ama: 'Sohler C, Krokowski J, Räcke H, Westermann M. Reducing State Changes with a Pipeline Buffer. In: Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004). ; 2004.' apa: Sohler, C., Krokowski, J., Räcke, H., & Westermann, M. (2004). Reducing State Changes with a Pipeline Buffer. In Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004). bibtex: '@inproceedings{Sohler_Krokowski_Räcke_Westermann_2004, title={Reducing State Changes with a Pipeline Buffer}, booktitle={Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004)}, author={Sohler, Christian and Krokowski, Jens and Räcke, Harald and Westermann, Matthias}, year={2004} }' chicago: Sohler, Christian, Jens Krokowski, Harald Räcke, and Matthias Westermann. “Reducing State Changes with a Pipeline Buffer.” In Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004. ieee: C. Sohler, J. Krokowski, H. Räcke, and M. Westermann, “Reducing State Changes with a Pipeline Buffer,” in Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004. mla: Sohler, Christian, et al. “Reducing State Changes with a Pipeline Buffer.” Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004. short: 'C. Sohler, J. Krokowski, H. Räcke, M. Westermann, in: Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004.' date_created: 2020-09-01T13:34:52Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng publication: Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004) status: public title: Reducing State Changes with a Pipeline Buffer type: conference user_id: '15415' year: '2004' ... --- _id: '18786' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj citation: ama: 'Sohler C, Czumaj A. Sublinear-Time Approximation for Clustering via Random Sampling. In: Automata, Languages and Programming (ICALP). ; 2004:396-407.' apa: Sohler, C., & Czumaj, A. (2004). Sublinear-Time Approximation for Clustering via Random Sampling. In Automata, Languages and Programming (ICALP) (pp. 396–407). bibtex: '@inproceedings{Sohler_Czumaj_2004, title={Sublinear-Time Approximation for Clustering via Random Sampling}, number={1}, booktitle={Automata, Languages and Programming (ICALP)}, author={Sohler, Christian and Czumaj, Artur}, year={2004}, pages={396–407} }' chicago: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering via Random Sampling.” In Automata, Languages and Programming (ICALP), 396–407, 2004. ieee: C. Sohler and A. Czumaj, “Sublinear-Time Approximation for Clustering via Random Sampling,” in Automata, Languages and Programming (ICALP), 2004, no. 1, pp. 396–407. mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering via Random Sampling.” Automata, Languages and Programming (ICALP), no. 1, 2004, pp. 396–407. short: 'C. Sohler, A. Czumaj, in: Automata, Languages and Programming (ICALP), 2004, pp. 396–407.' date_created: 2020-09-01T13:41:48Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' issue: '1' language: - iso: eng page: 396-407 publication: Automata, Languages and Programming (ICALP) status: public title: Sublinear-Time Approximation for Clustering via Random Sampling type: conference user_id: '15415' year: '2004' ... --- _id: '1911' author: - first_name: Ana full_name: Aguiar, Ana last_name: Aguiar - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Adam full_name: Wolisz, Adam last_name: Wolisz citation: ama: 'Aguiar A, Karl H, Wolisz A. Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy. In: Proceedings of European Wireless 2004, Barcelona / Spain . ; 2004.' apa: Aguiar, A., Karl, H., & Wolisz, A. (2004). Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy. In Proceedings of European Wireless 2004, Barcelona / Spain . bibtex: '@inproceedings{Aguiar_Karl_Wolisz_2004, title={Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy}, booktitle={Proceedings of European Wireless 2004, Barcelona / Spain }, author={Aguiar, Ana and Karl, Holger and Wolisz, Adam}, year={2004} }' chicago: Aguiar, Ana, Holger Karl, and Adam Wolisz. “Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy.” In Proceedings of European Wireless 2004, Barcelona / Spain , 2004. ieee: A. Aguiar, H. Karl, and A. Wolisz, “Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy,” in Proceedings of European Wireless 2004, Barcelona / Spain , 2004. mla: Aguiar, Ana, et al. “Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy.” Proceedings of European Wireless 2004, Barcelona / Spain , 2004. short: 'A. Aguiar, H. Karl, A. Wolisz, in: Proceedings of European Wireless 2004, Barcelona / Spain , 2004.' date_created: 2018-03-28T10:13:22Z date_updated: 2022-01-06T06:53:58Z department: - _id: '75' main_file_link: - url: http://research.ac.upc.edu/EW2004/papers/136.pdf publication: 'Proceedings of European Wireless 2004, Barcelona / Spain ' status: public title: Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy type: conference user_id: '15572' year: '2004' ... --- _id: '20931' abstract: - lang: eng text: Object-oriented software development is a subject area difficult to teach, espcially to beginners. They face a lot of abstraction and (from a beginners point of view) isolated topics, such as the syntax and semantics of a programming language, the functionality of a software development environment and basic object-oriented concepts. Although many professionals in education believe in the ``object first'' approach as the best method of introducing object-oriented concepts, there is no common agreement on how to start such courses. Current study programs often begin by teaching a programming language, instead of focusing on the basics of object-oriented concepts. In the last years a learning environment was developed based on a visual programming language to abstract away from details. It assists teaching step-by-step object-oriented concepts and the syntax and semantics of a programming language in secondary schools and first year university courses. Our goal is to port this learning environment to the widely used IDE Eclipse. author: - first_name: Matthias full_name: Meyer, Matthias id: '683' last_name: Meyer - first_name: Lothar full_name: Wendehals, Lothar last_name: Wendehals citation: ama: 'Meyer M, Wendehals L. Teaching Object-Oriented Concepts with Eclipse. In: Proc. of the Eclipse Technology EXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada. ACM Press; 2004:1-5.' apa: Meyer, M., & Wendehals, L. (2004). Teaching Object-Oriented Concepts with Eclipse. Proc. of the Eclipse Technology EXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada, 1–5. bibtex: '@inproceedings{Meyer_Wendehals_2004, title={Teaching Object-Oriented Concepts with Eclipse}, booktitle={Proc. of the Eclipse Technology eXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada}, publisher={ACM Press}, author={Meyer, Matthias and Wendehals, Lothar}, year={2004}, pages={1–5} }' chicago: Meyer, Matthias, and Lothar Wendehals. “Teaching Object-Oriented Concepts with Eclipse.” In Proc. of the Eclipse Technology EXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada, 1–5. ACM Press, 2004. ieee: M. Meyer and L. Wendehals, “Teaching Object-Oriented Concepts with Eclipse,” in Proc. of the Eclipse Technology eXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada, 2004, pp. 1–5. mla: Meyer, Matthias, and Lothar Wendehals. “Teaching Object-Oriented Concepts with Eclipse.” Proc. of the Eclipse Technology EXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada, ACM Press, 2004, pp. 1–5. short: 'M. Meyer, L. Wendehals, in: Proc. of the Eclipse Technology EXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada, ACM Press, 2004, pp. 1–5.' date_created: 2021-01-13T09:57:57Z date_updated: 2022-01-06T06:54:41Z department: - _id: '76' language: - iso: eng page: 1-5 publication: Proc. of the Eclipse Technology eXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada publisher: ACM Press status: public title: Teaching Object-Oriented Concepts with Eclipse type: conference user_id: '5786' year: '2004' ... --- _id: '20932' abstract: - lang: eng text: Design recovery, which means extracting design documents from source code, is usually done by static analysis techniques. Analysing behaviour by static analysis is very imprecise. We combine static and dynamic analysis to increase the preciseness of our design recovery process. In this paper we present an approach to collect data for the dynamic analysis by recording method calls during a program's execution. To reduce the amount of information we monitor only relevant classes and methods identified by static analysis. author: - first_name: Lothar full_name: Wendehals, Lothar last_name: Wendehals - first_name: Matthias full_name: Meyer, Matthias id: '683' last_name: Meyer - first_name: Andreas full_name: Elsner, Andreas last_name: Elsner citation: ama: 'Wendehals L, Meyer M, Elsner A. Selective Tracing of Java Programs. In: Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany. Vol tr-ri-04-253. Technical Report. University of Paderborn; 2004:7-10.' apa: Wendehals, L., Meyer, M., & Elsner, A. (2004). Selective Tracing of Java Programs. Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany, tr-ri-04-253, 7–10. bibtex: '@inproceedings{Wendehals_Meyer_Elsner_2004, series={Technical Report}, title={Selective Tracing of Java Programs}, volume={tr-ri-04-253}, booktitle={Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany}, publisher={University of Paderborn}, author={Wendehals, Lothar and Meyer, Matthias and Elsner, Andreas}, year={2004}, pages={7–10}, collection={Technical Report} }' chicago: Wendehals, Lothar, Matthias Meyer, and Andreas Elsner. “Selective Tracing of Java Programs.” In Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany, tr-ri-04-253:7–10. Technical Report. University of Paderborn, 2004. ieee: L. Wendehals, M. Meyer, and A. Elsner, “Selective Tracing of Java Programs,” in Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany, 2004, vol. tr-ri-04-253, pp. 7–10. mla: Wendehals, Lothar, et al. “Selective Tracing of Java Programs.” Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany, vol. tr-ri-04-253, University of Paderborn, 2004, pp. 7–10. short: 'L. Wendehals, M. Meyer, A. Elsner, in: Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany, University of Paderborn, 2004, pp. 7–10.' date_created: 2021-01-13T09:59:11Z date_updated: 2022-01-06T06:54:41Z department: - _id: '76' language: - iso: eng page: 7-10 publication: Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany publisher: University of Paderborn series_title: Technical Report status: public title: Selective Tracing of Java Programs type: conference user_id: '5786' volume: tr-ri-04-253 year: '2004' ... --- _id: '17986' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Vasco full_name: Brattka, Vasco last_name: Brattka citation: ama: Ziegler M, Brattka V. Computability in linear algebra. Theoretical Computer Science. 2004;326(1-3):187-211. doi:https://doi.org/10.1016/j.tcs.2004.06.022 apa: Ziegler, M., & Brattka, V. (2004). Computability in linear algebra. Theoretical Computer Science, 326(1–3), 187–211. https://doi.org/10.1016/j.tcs.2004.06.022 bibtex: '@article{Ziegler_Brattka_2004, title={Computability in linear algebra}, volume={326}, DOI={https://doi.org/10.1016/j.tcs.2004.06.022}, number={1–3}, journal={Theoretical Computer Science}, author={Ziegler, Martin and Brattka, Vasco}, year={2004}, pages={187–211} }' chicago: 'Ziegler, Martin, and Vasco Brattka. “Computability in Linear Algebra.” Theoretical Computer Science 326, no. 1–3 (2004): 187–211. https://doi.org/10.1016/j.tcs.2004.06.022.' ieee: M. Ziegler and V. Brattka, “Computability in linear algebra,” Theoretical Computer Science, vol. 326, no. 1–3, pp. 187–211, 2004. mla: Ziegler, Martin, and Vasco Brattka. “Computability in Linear Algebra.” Theoretical Computer Science, vol. 326, no. 1–3, 2004, pp. 187–211, doi:https://doi.org/10.1016/j.tcs.2004.06.022. short: M. Ziegler, V. Brattka, Theoretical Computer Science 326 (2004) 187–211. date_created: 2020-08-14T13:41:32Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: https://doi.org/10.1016/j.tcs.2004.06.022 intvolume: ' 326' issue: 1-3 language: - iso: eng page: 187-211 publication: Theoretical Computer Science publication_status: published status: public title: Computability in linear algebra type: journal_article user_id: '15415' volume: 326 year: '2004' ... --- _id: '18260' abstract: - lang: eng text: "For uniform computability of regular sets in Euclidean space, previous work has identified twelve 'basic' notions, to (pairs of) which many previous notions considered in literature were shown to be equivalent.\r\n\r\nWith respect to those basic notions, we now investigate on the computability of natural OPERATIONS on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions." author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Computable operators on regular sets. In: Computability and Complexity in Analysis. Vol 50. ; 2004:392-404. doi:10.1002/malq.200310107' apa: Ziegler, M. (2004). Computable operators on regular sets. Computability and Complexity in Analysis, 50(4–5), 392–404. https://doi.org/10.1002/malq.200310107 bibtex: '@inproceedings{Ziegler_2004, title={Computable operators on regular sets}, volume={50}, DOI={10.1002/malq.200310107}, number={4–5}, booktitle={Computability and Complexity in Analysis}, author={Ziegler, Martin}, year={2004}, pages={392–404} }' chicago: Ziegler, Martin. “Computable Operators on Regular Sets.” In Computability and Complexity in Analysis, 50:392–404, 2004. https://doi.org/10.1002/malq.200310107. ieee: 'M. Ziegler, “Computable operators on regular sets,” in Computability and Complexity in Analysis, 2004, vol. 50, no. 4–5, pp. 392–404, doi: 10.1002/malq.200310107.' mla: Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and Complexity in Analysis, vol. 50, no. 4–5, 2004, pp. 392–404, doi:10.1002/malq.200310107. short: 'M. Ziegler, in: Computability and Complexity in Analysis, 2004, pp. 392–404.' date_created: 2020-08-25T10:31:45Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1002/malq.200310107 intvolume: ' 50' issue: 4-5 language: - iso: eng page: 392-404 publication: Computability and Complexity in Analysis publication_identifier: issn: - 0942-5616 - 1521-3870 publication_status: published status: public title: Computable operators on regular sets type: conference user_id: '15415' volume: 50 year: '2004' ... --- _id: '18263' abstract: - lang: eng text: We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients, simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N^0.334) per point. author: - first_name: Michael full_name: Nüsken, Michael last_name: Nüsken - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials. In: Proc. 12th Annual Symposium on Algorithms (ESA’04). Vol 3221. Berlin, Heidelberg: Springer; 2004:544-555. doi:10.1007/978-3-540-30140-0_49' apa: 'Nüsken, M., & Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-30140-0_49' bibtex: '@inproceedings{Nüsken_Ziegler_2004, place={Berlin, Heidelberg}, title={Fast Multipoint Evaluation of Bivariate Polynomials}, volume={3221}, DOI={10.1007/978-3-540-30140-0_49}, booktitle={Proc. 12th Annual Symposium on Algorithms (ESA’04)}, publisher={Springer}, author={Nüsken, Michael and Ziegler, Martin}, year={2004}, pages={544–555} }' chicago: 'Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” In Proc. 12th Annual Symposium on Algorithms (ESA’04), 3221:544–55. Berlin, Heidelberg: Springer, 2004. https://doi.org/10.1007/978-3-540-30140-0_49.' ieee: M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,” in Proc. 12th Annual Symposium on Algorithms (ESA’04), 2004, vol. 3221, pp. 544–555. mla: Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.” Proc. 12th Annual Symposium on Algorithms (ESA’04), vol. 3221, Springer, 2004, pp. 544–55, doi:10.1007/978-3-540-30140-0_49. short: 'M. Nüsken, M. Ziegler, in: Proc. 12th Annual Symposium on Algorithms (ESA’04), Springer, Berlin, Heidelberg, 2004, pp. 544–555.' date_created: 2020-08-25T11:25:11Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/978-3-540-30140-0_49 intvolume: ' 3221' language: - iso: eng page: 544-555 place: Berlin, Heidelberg publication: Proc. 12th Annual Symposium on Algorithms (ESA'04) publication_identifier: isbn: - '9783540230250' - '9783540301400' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Fast Multipoint Evaluation of Bivariate Polynomials type: conference user_id: '15415' volume: 3221 year: '2004' ... --- _id: '18279' abstract: - lang: eng text: 'For $c in REAL$, a $c$-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most $c$ times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. For geometric searching, it turned out to suffice whether the radius rather than the length of some path between any two vertices is bounded relatively to their geometric distance; this is the defining property of weak spanners. Finally regarding radio network applications, a power spanner accounts for the total energy afforded for a wireless transmission with the requirement that the sum of the squares of the lengths of some path between any two planar vertices must be bounded relatively to the square of their geometric distance (or higher powers up to 6 or even 8).

While it is known that any $c$-spanner is also both a weak $C_1$-spanner and a $C_2$-power spanner (for appropriate $C_1,C_2$ depending only on $c$ but not on the graph under consideration), we show that the converse fails: There exists a family of $c_1$-power spanners that are no weak $C$-spanners and also a family of weak $c_2$-spanners that are no $C$-spanners for any fixed $C$ (and thus no uniform spanners, either). However the deepest result of the present work reveals that, surprisingly, any weak spanner is also a uniform power spanner. We further generalize the latter notion by considering $(c,delta)$-power spanners where the sum of the $delta$-th powers of the lengths has to be bounded; so $(cdot,2)$-power spanners coincide with the usual power spanners and $(cdot,1)$-power spanners are classical spanners. Interestingly, these $(cdot,delta)$-power spanners form a strict hierarchy where the above results still hold for any $deltageq2$; some even hold for $delta>1$ while counterexamples reveal others to fail for $delta<2$. In fact we show that in general every self-similar curve of fractal dimension $d>delta$ is no $(C,delta)$-power spanner for any fixed $C$. ' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04). Vol 3341. Berlin, Heidelberg: Springer ; 2004:805-821. doi:10.1007/978-3-540-30551-4_69' apa: 'Schindelhauer, C., Volbert, K., & Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer . https://doi.org/10.1007/978-3-540-30551-4_69' bibtex: '@inproceedings{Schindelhauer_Volbert_Ziegler_2004, place={Berlin, Heidelberg}, title={Spanners, Weak Spanners, and Power Spanners for Wireless Networks}, volume={3341}, DOI={10.1007/978-3-540-30551-4_69}, booktitle={Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)}, publisher={Springer }, author={Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, year={2004}, pages={805–821} }' chicago: 'Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 3341:805–21. Berlin, Heidelberg: Springer , 2004. https://doi.org/10.1007/978-3-540-30551-4_69.' ieee: C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821. mla: Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69. short: 'C. Schindelhauer, K. Volbert, M. Ziegler, in: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), Springer , Berlin, Heidelberg, 2004, pp. 805–821.' date_created: 2020-08-25T12:30:19Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/978-3-540-30551-4_69 intvolume: ' 3341' language: - iso: eng page: 805-821 place: Berlin, Heidelberg publication: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04) publication_identifier: isbn: - '9783540241317' - '9783540305514' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: 'Springer ' status: public title: Spanners, Weak Spanners, and Power Spanners for Wireless Networks type: conference user_id: '15415' volume: 3341 year: '2004' ... --- _id: '18364' abstract: - lang: eng text: "The visualisation of manufacturing-processes assists the user in understanding and analysis.\r\nTypically he can move free and unguided in a virtual environment which visualizes the entire\r\nprocess. Thus knowledge and conclusions are to some extend acquired on a random base.\r\nThis article describes the development of a tool, which enables the user to interactively improve\r\nsignificant production processes in the simulation. He moves in a virtual 3D-environment\r\n(walkthrough system) and is able to acquire automatically calculated indications for significant\r\nprocesses. At the same time the simulation considers significant objects in a more detailed way. If\r\nthe viewer is interested in a significant process, he is automatically guided to the relevant location\r\nwhere he can examine the critical situation by modification of the simulation model." author: - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: 'Christoph ' full_name: 'Laroque, Christoph ' last_name: Laroque - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Michael full_name: Kortenjan, Michael last_name: Kortenjan citation: ama: 'Mueck B, Dangelmaier W, Laroque C, Fischer M, Kortenjan M. Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In: Simulation and Visualisation 2004. Magdeburg: SCS European Publishing House; 2004:73-83.' apa: 'Mueck, B., Dangelmaier, W., Laroque, C., Fischer, M., & Kortenjan, M. (2004). Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In Simulation and Visualisation 2004 (pp. 73–83). Magdeburg: SCS European Publishing House.' bibtex: '@inproceedings{Mueck_Dangelmaier_Laroque_Fischer_Kortenjan_2004, place={Magdeburg}, title={Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations}, booktitle={Simulation and Visualisation 2004}, publisher={SCS European Publishing House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Laroque, Christoph and Fischer, Matthias and Kortenjan, Michael}, year={2004}, pages={73–83} }' chicago: 'Mueck, Bengt, Wilhelm Dangelmaier, Christoph Laroque, Matthias Fischer, and Michael Kortenjan. “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations.” In Simulation and Visualisation 2004, 73–83. Magdeburg: SCS European Publishing House, 2004.' ieee: B. Mueck, W. Dangelmaier, C. Laroque, M. Fischer, and M. Kortenjan, “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations,” in Simulation and Visualisation 2004, 2004, pp. 73–83. mla: Mueck, Bengt, et al. “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations.” Simulation and Visualisation 2004, SCS European Publishing House, 2004, pp. 73–83. short: 'B. Mueck, W. Dangelmaier, C. Laroque, M. Fischer, M. Kortenjan, in: Simulation and Visualisation 2004, SCS European Publishing House, Magdeburg, 2004, pp. 73–83.' date_created: 2020-08-26T12:29:21Z date_updated: 2022-01-06T06:53:30Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-26T12:29:05Z date_updated: 2020-08-26T12:29:05Z file_id: '18365' file_name: hni-id-1642.pdf file_size: 1767621 relation: main_file success: 1 file_date_updated: 2020-08-26T12:29:05Z has_accepted_license: '1' language: - iso: eng page: 73-83 place: Magdeburg publication: Simulation and Visualisation 2004 publisher: SCS European Publishing House status: public title: Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations type: conference user_id: '15415' year: '2004' ... --- _id: '18447' author: - first_name: Brigitte full_name: Oesterdiekhoff, Brigitte last_name: Oesterdiekhoff citation: ama: Oesterdiekhoff B. Transcoding von Webinhalten. Informatik Spektrum. 2004;27(5):448-452. apa: Oesterdiekhoff, B. (2004). Transcoding von Webinhalten. Informatik Spektrum, 27(5), 448–452. bibtex: '@article{Oesterdiekhoff_2004, title={Transcoding von Webinhalten}, volume={27}, number={5}, journal={Informatik Spektrum}, author={Oesterdiekhoff, Brigitte}, year={2004}, pages={448–452} }' chicago: 'Oesterdiekhoff, Brigitte. “Transcoding von Webinhalten.” Informatik Spektrum 27, no. 5 (2004): 448–52.' ieee: B. Oesterdiekhoff, “Transcoding von Webinhalten,” Informatik Spektrum, vol. 27, no. 5, pp. 448–452, 2004. mla: Oesterdiekhoff, Brigitte. “Transcoding von Webinhalten.” Informatik Spektrum, vol. 27, no. 5, 2004, pp. 448–52. short: B. Oesterdiekhoff, Informatik Spektrum 27 (2004) 448–452. date_created: 2020-08-27T11:52:37Z date_updated: 2022-01-06T06:53:32Z department: - _id: '63' intvolume: ' 27' issue: '5' language: - iso: eng page: 448-452 publication: Informatik Spektrum status: public title: Transcoding von Webinhalten type: journal_article user_id: '15415' volume: 27 year: '2004' ... --- _id: '18448' author: - first_name: Brigitte full_name: Oesterdiekhoff, Brigitte last_name: Oesterdiekhoff citation: ama: 'Oesterdiekhoff B. Internet Premium Services for Flexible Format Distributed Devices. In: Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04). ; 2004.' apa: Oesterdiekhoff, B. (2004). Internet Premium Services for Flexible Format Distributed Devices. In Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04). bibtex: '@inproceedings{Oesterdiekhoff_2004, title={Internet Premium Services for Flexible Format Distributed Devices}, booktitle={Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04)}, author={Oesterdiekhoff, Brigitte}, year={2004} }' chicago: Oesterdiekhoff, Brigitte. “Internet Premium Services for Flexible Format Distributed Devices.” In Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04), 2004. ieee: B. Oesterdiekhoff, “Internet Premium Services for Flexible Format Distributed Devices,” in Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04), 2004. mla: Oesterdiekhoff, Brigitte. “Internet Premium Services for Flexible Format Distributed Devices.” Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04), 2004. short: 'B. Oesterdiekhoff, in: Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04), 2004.' date_created: 2020-08-27T11:58:50Z date_updated: 2022-01-06T06:53:32Z department: - _id: '63' language: - iso: eng publication: Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES'04) status: public title: Internet Premium Services for Flexible Format Distributed Devices type: conference user_id: '15415' year: '2004' ... --- _id: '21780' author: - first_name: F. full_name: Goetz, F. last_name: Goetz - first_name: B. full_name: Boenning, B. last_name: Boenning - first_name: Gitta full_name: Domik, Gitta id: '90' last_name: Domik citation: ama: 'Goetz F, Boenning B, Domik G. Mapping High Quality Textures on an Interactive Globe. In: Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing. ; 2004.' apa: Goetz, F., Boenning, B., & Domik, G. (2004). Mapping High Quality Textures on an Interactive Globe. In Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing. bibtex: '@inproceedings{Goetz_Boenning_Domik_2004, title={Mapping High Quality Textures on an Interactive Globe}, booktitle={Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing}, author={Goetz, F. and Boenning, B. and Domik, Gitta}, year={2004} }' chicago: Goetz, F., B. Boenning, and Gitta Domik. “Mapping High Quality Textures on an Interactive Globe.” In Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing, 2004. ieee: F. Goetz, B. Boenning, and G. Domik, “Mapping High Quality Textures on an Interactive Globe,” in Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing, 2004. mla: Goetz, F., et al. “Mapping High Quality Textures on an Interactive Globe.” Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing, 2004. short: 'F. Goetz, B. Boenning, G. Domik, in: Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing, 2004.' date_created: 2021-04-25T17:25:37Z date_updated: 2022-01-06T06:55:13Z department: - _id: '65' language: - iso: eng publication: Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing status: public title: Mapping High Quality Textures on an Interactive Globe type: conference user_id: '14955' year: '2004' ...