---
_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: '16474'
abstract:
- lang: eng
text: "Given n distinct points p1, p2, ... , pn in the plane, the map labeling\r\nproblem
with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn\r\nof
maximum possible size such that pi is a corner of Qi and no two squares overlap.\r\nThis
problem is NP-hard and no algorithm with approximation ratio better\r\nthan 1/2
exists unless P = NP [10].\r\nIn this paper, we consider a scenario where we want
to visualize the information\r\ngathered by smart dust, i.e. by a large set of
simple devices, each consisting of\r\na sensor and a sender that can gather sensor
data and send it to a central station.\r\nOur task is to label (the positions
of) these sensors in a way described by the\r\nlabeling problem above. Since these
devices are not positioned accurately (for\r\nexample, they might be dropped from
an airplane), this gives rise to consider the\r\nmap labeling problem under the
assumption, that the positions of the points are\r\nnot fixed precisely, but perturbed
by random noise. In other words, we consider\r\nthe smoothed complexity of the
map labeling problem. We present an algorithm\r\nthat, under such an assumption
and Gaussian random noise with sufficiently large\r\nvariance, has linear smoothed
complexity."
author:
- first_name: Vikas
full_name: Bansal, Vikas
last_name: Bansal
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: 12th
Annual European Symposium on Algorithms (ESA 2004). Vol 3221. Lecture Notes
in Computer Science. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_9'
apa: Bansal, V., Meyer auf der Heide, F., & Sohler, C. (2004). Labeling Smart
Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol.
3221). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_9
bibtex: '@inproceedings{Bansal_Meyer auf der Heide_Sohler_2004, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Labeling Smart Dust}, volume={3221},
DOI={10.1007/978-3-540-30140-0_9},
booktitle={12th Annual European Symposium on Algorithms (ESA 2004)}, author={Bansal,
Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2004},
collection={Lecture Notes in Computer Science} }'
chicago: Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling
Smart Dust.” In 12th Annual European Symposium on Algorithms (ESA 2004),
Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30140-0_9.
ieee: V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in
12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.
mla: Bansal, Vikas, et al. “Labeling Smart Dust.” 12th Annual European Symposium
on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9.
short: 'V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium
on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.'
date_created: 2020-04-08T11:07:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_9
intvolume: ' 3221'
language:
- iso: eng
place: Berlin, Heidelberg
publication: 12th Annual European Symposium on Algorithms (ESA 2004)
publication_identifier:
isbn:
- '9783540230250'
- '9783540301400'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: Labeling Smart Dust
type: conference
user_id: '15415'
volume: 3221
year: '2004'
...
---
_id: '16475'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Fighting against two
adversaries. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism
in Algorithms and Architectures - SPAA ’04. ; 2004. doi:10.1145/1007912.1007923'
apa: Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2004). Fighting
against two adversaries. In Proceedings of the sixteenth annual ACM symposium
on Parallelism in algorithms and architectures - SPAA ’04. https://doi.org/10.1145/1007912.1007923
bibtex: '@inproceedings{Bienkowski_Korzeniowski_Meyer auf der Heide_2004, title={Fighting
against two adversaries}, DOI={10.1145/1007912.1007923},
booktitle={Proceedings of the sixteenth annual ACM symposium on Parallelism in
algorithms and architectures - SPAA ’04}, author={Bienkowski, Marcin and Korzeniowski,
Miroslaw and Meyer auf der Heide, Friedhelm}, year={2004} }'
chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der
Heide. “Fighting against Two Adversaries.” In Proceedings of the Sixteenth
Annual ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’04,
2004. https://doi.org/10.1145/1007912.1007923.
ieee: M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Fighting against
two adversaries,” in Proceedings of the sixteenth annual ACM symposium on Parallelism
in algorithms and architectures - SPAA ’04, 2004.
mla: Bienkowski, Marcin, et al. “Fighting against Two Adversaries.” Proceedings
of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
- SPAA ’04, 2004, doi:10.1145/1007912.1007923.
short: 'M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Proceedings
of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
- SPAA ’04, 2004.'
date_created: 2020-04-08T11:10:54Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1007912.1007923
language:
- iso: eng
publication: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms
and architectures - SPAA '04
publication_identifier:
isbn:
- '1581138407'
publication_status: published
status: public
title: Fighting against two adversaries
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '16477'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
citation:
ama: Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Congestion,
Dilation, and Energy in Radio Networks. Theory of Computing Systems. 2004:343-370.
doi:10.1007/s00224-004-1124-z
apa: Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M.
(2004). Congestion, Dilation, and Energy in Radio Networks. Theory of Computing
Systems, 343–370. https://doi.org/10.1007/s00224-004-1124-z
bibtex: '@article{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2004, title={Congestion,
Dilation, and Energy in Radio Networks}, DOI={10.1007/s00224-004-1124-z},
journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm
and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, year={2004},
pages={343–370} }'
chicago: Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert,
and Matthias Grünewald. “Congestion, Dilation, and Energy in Radio Networks.”
Theory of Computing Systems, 2004, 343–70. https://doi.org/10.1007/s00224-004-1124-z.
ieee: F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Congestion,
Dilation, and Energy in Radio Networks,” Theory of Computing Systems, pp.
343–370, 2004.
mla: Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in
Radio Networks.” Theory of Computing Systems, 2004, pp. 343–70, doi:10.1007/s00224-004-1124-z.
short: F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, Theory
of Computing Systems (2004) 343–370.
date_created: 2020-04-08T11:17:35Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/s00224-004-1124-z
language:
- iso: eng
page: 343-370
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Congestion, Dilation, and Energy in Radio Networks
type: journal_article
user_id: '15415'
year: '2004'
...
---
_id: '16480'
author:
- first_name: S.
full_name: Leonardi, S.
last_name: Leonardi
- first_name: A.
full_name: Marchetti-Spaccamela, A.
last_name: Marchetti-Spaccamela
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Leonardi S, Marchetti-Spaccamela A, Meyer auf der Heide F. Scheduling against
an adversarial network. In: SPAA ’04: Proceedings of the Sixteenth Annual ACM
Symposium on Parallelism in Algorithms and Architectures. ; 2004. doi:10.1145/1007912.1007936'
apa: 'Leonardi, S., Marchetti-Spaccamela, A., & Meyer auf der Heide, F. (2004).
Scheduling against an adversarial network. In SPAA ’04: Proceedings of the
sixteenth annual ACM symposium on Parallelism in algorithms and architectures.
https://doi.org/10.1145/1007912.1007936'
bibtex: '@inproceedings{Leonardi_Marchetti-Spaccamela_Meyer auf der Heide_2004,
title={Scheduling against an adversarial network}, DOI={10.1145/1007912.1007936},
booktitle={SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism
in algorithms and architectures}, author={Leonardi, S. and Marchetti-Spaccamela,
A. and Meyer auf der Heide, Friedhelm}, year={2004} }'
chicago: 'Leonardi, S., A. Marchetti-Spaccamela, and Friedhelm Meyer auf der Heide.
“Scheduling against an Adversarial Network.” In SPAA ’04: Proceedings of the
Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures,
2004. https://doi.org/10.1145/1007912.1007936.'
ieee: 'S. Leonardi, A. Marchetti-Spaccamela, and F. Meyer auf der Heide, “Scheduling
against an adversarial network,” in SPAA ’04: Proceedings of the sixteenth
annual ACM symposium on Parallelism in algorithms and architectures, 2004.'
mla: 'Leonardi, S., et al. “Scheduling against an Adversarial Network.” SPAA
’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms
and Architectures, 2004, doi:10.1145/1007912.1007936.'
short: 'S. Leonardi, A. Marchetti-Spaccamela, F. Meyer auf der Heide, in: SPAA ’04:
Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms
and Architectures, 2004.'
date_created: 2020-04-09T06:51:22Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1007912.1007936
language:
- iso: eng
publication: 'SPAA ''04: Proceedings of the sixteenth annual ACM symposium on Parallelism
in algorithms and architectures'
publication_identifier:
isbn:
- '1581138407'
publication_status: published
status: public
title: Scheduling against an adversarial network
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '16399'
abstract:
- lang: eng
text: "We present a new data structure for rendering highly complex virtual environments
of arbitrary topology. The special feature of our approach is that it allows an
interactive navigation in very large scenes (30 GB/400 million polygons in our
benchmark scenes) that cannot be stored in main memory, but only on a local or
remote hard disk. Furthermore, it allows interactive rendering of substantially
more complex scenes by instantiating objects.\r\n\r\nThe sampling process is done
in the preprocessing. There, the polygons are randomly distributed in our hierarchical
data structure, the randomized sample tree. This tree only uses space that is
linear in the number of polygons. In order to produce an approximate image of
the scene, the tree is traversed and polygons stored in the visited nodes are
rendered. During the interactive walkthrough, parts of the sample tree are loaded
from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical
walkthrough system. Analysis and experiments show that the quality of our images
is comparable to images computed by the conventional z-buffer algorithm regardless
of the scene topology."
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The
Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally
Stored Virtual Environments. Presence: Teleoperators and Virtual Environments.
2004:617-637. doi:10.1162/1054746043280619'
apa: 'Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf
der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive
Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators
and Virtual Environments, 617–637. https://doi.org/10.1162/1054746043280619'
bibtex: '@article{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2004, title={The
Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally
Stored Virtual Environments}, DOI={10.1162/1054746043280619},
journal={Presence: Teleoperators and Virtual Environments}, author={Klein, Jan
and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and
Meyer auf der Heide, Friedhelm}, year={2004}, pages={617–637} }'
chicago: 'Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka,
and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure
for Interactive Walk-Throughs in Externally Stored Virtual Environments.” Presence:
Teleoperators and Virtual Environments, 2004, 617–37. https://doi.org/10.1162/1054746043280619.'
ieee: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der
Heide, “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs
in Externally Stored Virtual Environments,” Presence: Teleoperators and Virtual
Environments, pp. 617–637, 2004.'
mla: 'Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive
Walk-Throughs in Externally Stored Virtual Environments.” Presence: Teleoperators
and Virtual Environments, 2004, pp. 617–37, doi:10.1162/1054746043280619.'
short: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der
Heide, Presence: Teleoperators and Virtual Environments (2004) 617–637.'
date_created: 2020-04-03T11:42:11Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1162/1054746043280619
language:
- iso: eng
page: 617-637
publication: 'Presence: Teleoperators and Virtual Environments'
publication_identifier:
issn:
- 1054-7460
- 1531-3263
publication_status: published
status: public
title: 'The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs
in Externally Stored Virtual Environments'
type: journal_article
user_id: '15415'
year: '2004'
...
---
_id: '13071'
author:
- first_name: Michelle
full_name: Liu Jing, Michelle
last_name: Liu Jing
- first_name: Stefan
full_name: Ruehrup, Stefan
last_name: Ruehrup
- 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: Dierkes, Martin
last_name: Dierkes
- first_name: Andreas
full_name: Bellgardt, Andreas
last_name: Bellgardt
- first_name: Rüdiger
full_name: Ibers, Rüdiger
id: '659'
last_name: Ibers
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
last_name: Hilleringmann
citation:
ama: 'Liu Jing M, Ruehrup S, Schindelhauer C, et al. Sensor Networks with More Features
Using Less Hardware. In: {GOR/NGB Conference Tilburg 2004}. Tilburg, Netherlands;
2004.'
apa: Liu Jing, M., Ruehrup, S., Schindelhauer, C., Volbert, K., Dierkes, M., Bellgardt,
A., … Hilleringmann, U. (2004). Sensor Networks with More Features Using Less
Hardware. In {GOR/NGB Conference Tilburg 2004}. Tilburg, Netherlands.
bibtex: '@inproceedings{Liu Jing_Ruehrup_Schindelhauer_Volbert_Dierkes_Bellgardt_Ibers_Hilleringmann_2004,
place={Tilburg, Netherlands}, title={Sensor Networks with More Features Using
Less Hardware}, booktitle={{GOR/NGB Conference Tilburg 2004}}, author={Liu Jing,
Michelle and Ruehrup, Stefan and Schindelhauer, Christian and Volbert, Klaus and
Dierkes, Martin and Bellgardt, Andreas and Ibers, Rüdiger and Hilleringmann, Ulrich},
year={2004} }'
chicago: Liu Jing, Michelle, Stefan Ruehrup, Christian Schindelhauer, Klaus Volbert,
Martin Dierkes, Andreas Bellgardt, Rüdiger Ibers, and Ulrich Hilleringmann. “Sensor
Networks with More Features Using Less Hardware.” In {GOR/NGB Conference Tilburg
2004}. Tilburg, Netherlands, 2004.
ieee: M. Liu Jing et al., “Sensor Networks with More Features Using Less
Hardware,” in {GOR/NGB Conference Tilburg 2004}, 2004.
mla: Liu Jing, Michelle, et al. “Sensor Networks with More Features Using Less Hardware.”
{GOR/NGB Conference Tilburg 2004}, 2004.
short: 'M. Liu Jing, S. Ruehrup, C. Schindelhauer, K. Volbert, M. Dierkes, A. Bellgardt,
R. Ibers, U. Hilleringmann, in: {GOR/NGB Conference Tilburg 2004}, Tilburg, Netherlands,
2004.'
date_created: 2019-08-28T11:58:24Z
date_updated: 2022-01-06T06:51:28Z
department:
- _id: '48'
- _id: '63'
language:
- iso: eng
place: Tilburg, Netherlands
publication: '{GOR/NGB Conference Tilburg 2004}'
status: public
title: Sensor Networks with More Features Using Less Hardware
type: conference
user_id: '14955'
year: '2004'
...
---
_id: '19726'
abstract:
- lang: eng
text: The Paderborn University BSP (PUB) library is a C communication library based
on the BSP model. The basic library supports buffered as well as unbuffered non-blocking
communication between any pair of processors and a mechanism for synchronizing
the processors in a barrier style. In addition, PUB provides non-blocking collective
communication operations on arbitrary subsets of processors, the ability to partition
the processors into independent groups that execute asynchronously from each other,
and a zero-cost synchronization mechanism. Furthermore, some techniques used in
the implementation of the PUB library deviate significantly from the techniques
used in other BSP libraries.
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
- first_name: Ingo
full_name: von Otte, Ingo
last_name: von Otte
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: Bonorden O, Juurlink B, von Otte I, Rieping I. The Paderborn University BSP
(PUB) library. Parallel Computing. 2003:187-207. doi:10.1016/s0167-8191(02)00218-1
apa: Bonorden, O., Juurlink, B., von Otte, I., & Rieping, I. (2003). The Paderborn
University BSP (PUB) library. Parallel Computing, 187–207. https://doi.org/10.1016/s0167-8191(02)00218-1
bibtex: '@article{Bonorden_Juurlink_von Otte_Rieping_2003, title={The Paderborn
University BSP (PUB) library}, DOI={10.1016/s0167-8191(02)00218-1},
journal={Parallel Computing}, author={Bonorden, Olaf and Juurlink, Bernhardus
and von Otte, Ingo and Rieping, Ingo}, year={2003}, pages={187–207} }'
chicago: Bonorden, Olaf, Bernhardus Juurlink, Ingo von Otte, and Ingo Rieping. “The
Paderborn University BSP (PUB) Library.” Parallel Computing, 2003, 187–207.
https://doi.org/10.1016/s0167-8191(02)00218-1.
ieee: O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The Paderborn University
BSP (PUB) library,” Parallel Computing, pp. 187–207, 2003.
mla: Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library.” Parallel
Computing, 2003, pp. 187–207, doi:10.1016/s0167-8191(02)00218-1.
short: O. Bonorden, B. Juurlink, I. von Otte, I. Rieping, Parallel Computing (2003)
187–207.
date_created: 2020-09-28T10:39:53Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1016/s0167-8191(02)00218-1
language:
- iso: eng
page: 187-207
publication: Parallel Computing
publication_identifier:
issn:
- 0167-8191
publication_status: published
status: public
title: The Paderborn University BSP (PUB) library
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '19785'
author:
- first_name: Kay A.
full_name: Salzwedel, Kay A.
last_name: Salzwedel
citation:
ama: Salzwedel KA. Algorithmic Approaches for Storage Networks. Algorithms for
Memory Hierarchies. 2003;2625. doi:10.1007/3-540-36574-5_12
apa: Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. Algorithms
for Memory Hierarchies, 2625. https://doi.org/10.1007/3-540-36574-5_12
bibtex: '@article{Salzwedel_2003, title={Algorithmic Approaches for Storage Networks},
volume={2625}, DOI={10.1007/3-540-36574-5_12},
journal={Algorithms for Memory Hierarchies}, author={Salzwedel, Kay A.}, year={2003}
}'
chicago: Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” Algorithms
for Memory Hierarchies 2625 (2003). https://doi.org/10.1007/3-540-36574-5_12.
ieee: K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms
for Memory Hierarchies, vol. 2625, 2003.
mla: Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” Algorithms
for Memory Hierarchies, vol. 2625, 2003, doi:10.1007/3-540-36574-5_12.
short: K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).
date_created: 2020-09-30T10:27:11Z
date_updated: 2022-01-06T06:54:12Z
department:
- _id: '63'
doi: 10.1007/3-540-36574-5_12
intvolume: ' 2625'
language:
- iso: eng
publication: Algorithms for Memory Hierarchies
publication_identifier:
isbn:
- '9783540008835'
- '9783540365747'
issn:
- 0302-9743
publication_status: published
status: public
title: Algorithmic Approaches for Storage Networks
type: journal_article
user_id: '15415'
volume: 2625
year: '2003'
...
---
_id: '19790'
abstract:
- lang: eng
text: The advances in Internet technology have led to tremendous improvements in
business, education, and science and have changed the way we think, live, and
communicate. Information exchange has become ubiquitous by the possibilities offered
through modern technologies. We are able to offer information 24 hours a day through
our web sites and can leave messages every time and from anywhere in the world.
This change in communication has led to new challenges. Enterprises have to deal
with an information amount that doubles every year. The technological foundation
to cope with this information explosion is given by Storage Area Networks (SANs),
which are able to connect a great number of storage systems over a fast interconnection
network. However, to be able to use the benefits of a SAN, an easy-to-use and
efficient management support has to be given to the storage administrator. In
this paper, we will suggest new storage management concepts and we will introduce
a new management environment that is able to significantly reduce management costs
and increases the performance and resource utilization of the given SAN infrastructure.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M,
Rückert U. Storage Management as Means to cope with Exponential Information Growth.
In: Proceedings of SSGRR 2003. ; 2003.'
apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential
Information Growth. In Proceedings of SSGRR 2003.
bibtex: '@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003,
title={Storage Management as Means to cope with Exponential Information Growth},
booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel,
Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario
and Rückert, Ulrich}, year={2003} }'
chicago: Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André
Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to
Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003,
2003.
ieee: C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
and U. Rückert, “Storage Management as Means to cope with Exponential Information
Growth,” in Proceedings of SSGRR 2003, 2003.
mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
Information Growth.” Proceedings of SSGRR 2003, 2003.
short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
U. Rückert, in: Proceedings of SSGRR 2003, 2003.'
date_created: 2020-09-30T12:04:14Z
date_updated: 2022-01-06T06:54:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '58'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-30T12:03:57Z
date_updated: 2020-09-30T12:03:57Z
file_id: '19793'
file_name: pub-hni-908.pdf
file_size: 499057
relation: main_file
success: 1
file_date_updated: 2020-09-30T12:03:57Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of SSGRR 2003
status: public
title: Storage Management as Means to cope with Exponential Information Growth
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19806'
abstract:
- lang: eng
text: We try to close the gap between theoretical investigations of wireless network
topologies and realistic wireless environments. For point-to-point communication,
we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the
SparsY-graph, and the SymmY-graph. We present distributed algorithms that can
be used to build up these graphs in time $O(log n)$ per node without the use of
any geo-graphical positioning system. Our algorithms are based only on local knowledge
and local decisions and make use of power control to establish communication links
with low energy-cost. We compare these algorithms with respect to congestion,
dilation, and energy. For congestion we introduce different measures that allow
us to investigate the difference between real-world wireless networks and models
for wireless communication at a high level of abstraction. For more realistic
simulations we extend our simulation environment SAHNE. We use a realistic transmission
model for directed communication that uses sector subdivision. Finally, our experimental
results show that our topologies and algorithms work well in a distributed environment
and we give some recommendations for the topology control based on our simulations.
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: 'Christian '
full_name: 'Schindelhauer, Christian '
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: M.
full_name: Grünewald, M.
last_name: Grünewald
citation:
ama: 'Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed
algorithms for topology control in wireless networks. In: Proceedings of the
International Parallel and Distributed Processing Symposium (IPDPS). ; 2003.
doi:10.1109/ipdps.2003.1213107'
apa: Rührup, S., Schindelhauer, C., Volbert, K., & Grünewald, M. (2003). Performance
of distributed algorithms for topology control in wireless networks. Proceedings
of the International Parallel and Distributed Processing Symposium (IPDPS).
https://doi.org/10.1109/ipdps.2003.1213107
bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_Grünewald_2003, title={Performance
of distributed algorithms for topology control in wireless networks}, DOI={10.1109/ipdps.2003.1213107},
booktitle={Proceedings of the International Parallel and Distributed Processing
Symposium (IPDPS)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert,
Klaus and Grünewald, M.}, year={2003} }'
chicago: Rührup, Stefan, Christian Schindelhauer, Klaus Volbert, and M. Grünewald.
“Performance of Distributed Algorithms for Topology Control in Wireless Networks.”
In Proceedings of the International Parallel and Distributed Processing Symposium
(IPDPS), 2003. https://doi.org/10.1109/ipdps.2003.1213107.
ieee: 'S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of
distributed algorithms for topology control in wireless networks,” 2003, doi:
10.1109/ipdps.2003.1213107.'
mla: Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology
Control in Wireless Networks.” Proceedings of the International Parallel and
Distributed Processing Symposium (IPDPS), 2003, doi:10.1109/ipdps.2003.1213107.
short: 'S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of
the International Parallel and Distributed Processing Symposium (IPDPS), 2003.'
date_created: 2020-09-30T12:51:22Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '58'
doi: 10.1109/ipdps.2003.1213107
language:
- iso: eng
publication: Proceedings of the International Parallel and Distributed Processing
Symposium (IPDPS)
publication_identifier:
isbn:
- '0769519261'
publication_status: published
status: public
title: Performance of distributed algorithms for topology control in wireless networks
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19828'
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: Mahlmann P. Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web.; 2003.
apa: Mahlmann, P. (2003). Implementierung und Vergleich von Verfahren zum Information
Retrieval im World Wide Web.
bibtex: '@book{Mahlmann_2003, title={Implementierung und Vergleich von Verfahren
zum Information Retrieval im World Wide Web}, author={Mahlmann, Peter}, year={2003}
}'
chicago: Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web, 2003.
ieee: P. Mahlmann, Implementierung und Vergleich von Verfahren zum Information
Retrieval im World Wide Web. 2003.
mla: Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web. 2003.
short: P. Mahlmann, Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web, 2003.
date_created: 2020-10-01T09:55:38Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Implementierung und Vergleich von Verfahren zum Information Retrieval im World
Wide Web
type: mastersthesis
user_id: '15415'
year: '2003'
...
---
_id: '19833'
abstract:
- lang: eng
text: Communication facilities are important in Robotics if several robots have
to work together. In this paper, we describe problems and solutions encountered
while designing an infrared-based communication device for the mini robot Khepera.
In contrast to traditional omnidirectional systems, it features directed, power-variable
transmission in eight directions at unit[23.4]kbps up to a range of unit[1m].
It can differentiate incoming data signals from interference from adjacent sectors
and can estimate their direction-of-arrival. We model the transmission over the
infrared channel and show how interference influences the reception of the data
signals. We also describe methods how to reduce these effects. We have tested
the performance of the resulted signal processing in a worst case scenario by
simulations and in experiments with a prototype implementation. The resulted module
is especially suited for experimental evaluation of ad hoc network protocols
and for position estimation.
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Volbert K, Grünewald M, Schindelhauer C, Rückert U. Directed power-variable
infrared communication for the mini robot Khepera. In: Proceedings of the 2nd
International Conference on Autonomous Minirobots for Research and Edutainment.
; 2003:113-122.'
apa: Volbert, K., Grünewald, M., Schindelhauer, C., & Rückert, U. (2003). Directed
power-variable infrared communication for the mini robot Khepera. In Proceedings
of the 2nd International Conference on Autonomous Minirobots for Research and
Edutainment (pp. 113–122).
bibtex: '@inproceedings{Volbert_Grünewald_Schindelhauer_Rückert_2003, title={Directed
power-variable infrared communication for the mini robot Khepera}, booktitle={Proceedings
of the 2nd International Conference on Autonomous Minirobots for Research and
Edutainment}, author={Volbert, Klaus and Grünewald, Matthias and Schindelhauer,
Christian and Rückert, Ulrich}, year={2003}, pages={113–122} }'
chicago: Volbert, Klaus, Matthias Grünewald, Christian Schindelhauer, and Ulrich
Rückert. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.”
In Proceedings of the 2nd International Conference on Autonomous Minirobots
for Research and Edutainment, 113–22, 2003.
ieee: K. Volbert, M. Grünewald, C. Schindelhauer, and U. Rückert, “Directed power-variable
infrared communication for the mini robot Khepera,” in Proceedings of the 2nd
International Conference on Autonomous Minirobots for Research and Edutainment,
2003, pp. 113–122.
mla: Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for
the Mini Robot Khepera.” Proceedings of the 2nd International Conference on
Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–22.
short: 'K. Volbert, M. Grünewald, C. Schindelhauer, U. Rückert, in: Proceedings
of the 2nd International Conference on Autonomous Minirobots for Research and
Edutainment, 2003, pp. 113–122.'
date_created: 2020-10-01T11:20:47Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '58'
language:
- iso: eng
page: 113-122
publication: Proceedings of the 2nd International Conference on Autonomous Minirobots
for Research and Edutainment
status: public
title: Directed power-variable infrared communication for the mini robot Khepera
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19874'
abstract:
- lang: eng
text: We present a novel framework for hierarchical collision detection that can
be applied to virtually all bounding volume (BV) hierarchies. It allows an application
to trade quality for speed. Our algorithm yields an estimation of the quality,
so that applications can specify the desired quality. In a timecritical system,
applications can specify the maximum time budget instead, and quantitatively assess
the quality of the results returned by the collision detection afterwards.
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. ADB-Trees: Controlling the Error of Time-Critical Collision
Detection. In: Proc. 8th International Fall Workshop Vision, Modeling, and
Visualization (VMV 2003). ; 2003:37-45.'
apa: 'Klein, J., & Zachmann, G. (2003). ADB-Trees: Controlling the Error of
Time-Critical Collision Detection. In Proc. 8th International Fall Workshop
Vision, Modeling, and Visualization (VMV 2003) (pp. 37–45).'
bibtex: '@inproceedings{Klein_Zachmann_2003, title={ADB-Trees: Controlling the Error
of Time-Critical Collision Detection}, booktitle={Proc. 8th International Fall
Workshop Vision, Modeling, and Visualization (VMV 2003)}, author={Klein, Jan and
Zachmann, Gabriel}, year={2003}, pages={37–45} }'
chicago: 'Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of
Time-Critical Collision Detection.” In Proc. 8th International Fall Workshop
Vision, Modeling, and Visualization (VMV 2003), 37–45, 2003.'
ieee: 'J. Klein and G. Zachmann, “ADB-Trees: Controlling the Error of Time-Critical
Collision Detection,” in Proc. 8th International Fall Workshop Vision, Modeling,
and Visualization (VMV 2003), 2003, pp. 37–45.'
mla: 'Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical
Collision Detection.” Proc. 8th International Fall Workshop Vision, Modeling,
and Visualization (VMV 2003), 2003, pp. 37–45.'
short: 'J. Klein, G. Zachmann, in: Proc. 8th International Fall Workshop Vision,
Modeling, and Visualization (VMV 2003), 2003, pp. 37–45.'
date_created: 2020-10-05T10:30:07Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 37-45
publication: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization
(VMV 2003)
status: public
title: 'ADB-Trees: Controlling the Error of Time-Critical Collision Detection'
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19900'
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. Time-Critical Collision Detection Using an Average-Case
Approach. In: Proc. ACM Symposium on Virtual Reality Software and Technology
(VRST 2003). ; 2003:22-31. doi:10.1145/1008653.1008660'
apa: Klein, J., & Zachmann, G. (2003). Time-Critical Collision Detection Using
an Average-Case Approach. In Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003) (pp. 22–31). https://doi.org/10.1145/1008653.1008660
bibtex: '@inproceedings{Klein_ Zachmann_2003, title={Time-Critical Collision Detection
Using an Average-Case Approach}, DOI={10.1145/1008653.1008660},
booktitle={ Proc. ACM Symposium on Virtual Reality Software and Technology (VRST
2003)}, author={Klein, Jan and Zachmann, Gabriel}, year={2003}, pages={22–31}
}'
chicago: Klein, Jan, and Gabriel Zachmann. “Time-Critical Collision Detection Using
an Average-Case Approach.” In Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003), 22–31, 2003. https://doi.org/10.1145/1008653.1008660.
ieee: J. Klein and G. Zachmann, “Time-Critical Collision Detection Using an Average-Case
Approach,” in Proc. ACM Symposium on Virtual Reality Software and Technology
(VRST 2003), 2003, pp. 22–31.
mla: Klein, Jan, and Gabriel Zachmann. “Time-Critical Collision Detection Using
an Average-Case Approach.” Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003), 2003, pp. 22–31, doi:10.1145/1008653.1008660.
short: 'J. Klein, G. Zachmann, in: Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003), 2003, pp. 22–31.'
date_created: 2020-10-06T08:31:35Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1145/1008653.1008660
language:
- iso: eng
page: 22-31
publication: ' Proc. ACM Symposium on Virtual Reality Software and Technology (VRST
2003)'
status: public
title: Time-Critical Collision Detection Using an Average-Case Approach
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19952'
abstract:
- lang: eng
text: Graph minors theory, developed by Robertson & Seymour, provides a list of
powerful theoretical results and tools. However, the wide spread opinion in Graph
Algorithms community about this theory is that it is mainly of theoretical importance.
The main purpose of this paper is to show how very deep min-max and duality theorems
from Graph Minors can be used to obtain essential speed-up to many known algorithms
on different domination problems.
author:
- first_name: Fedor V.
full_name: Fomin, Fedor V.
last_name: Fomin
- first_name: Dimitrios M.
full_name: Thilikos, Dimitrios M.
last_name: Thilikos
citation:
ama: 'Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and
Exponential Speed-Up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete
Algorithms (SODA 2003). ; 2003. doi:10.1137/s0097539702419649'
apa: 'Fomin, F. V., & Thilikos, D. M. (2003). Dominating Sets in Planar Graphs:
Branch-Width and Exponential Speed-Up. In Proceedings of the 14th ACM-SIAM
Symposium on Discrete Algorithms (SODA 2003). https://doi.org/10.1137/s0097539702419649'
bibtex: '@inproceedings{Fomin_Thilikos_2003, title={Dominating Sets in Planar Graphs:
Branch-Width and Exponential Speed-Up}, DOI={10.1137/s0097539702419649},
booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003)}, author={Fomin, Fedor V. and Thilikos, Dimitrios M.}, year={2003} }'
chicago: 'Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar
Graphs: Branch-Width and Exponential Speed-Up.” In Proceedings of the 14th
ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003. https://doi.org/10.1137/s0097539702419649.'
ieee: 'F. V. Fomin and D. M. Thilikos, “Dominating Sets in Planar Graphs: Branch-Width
and Exponential Speed-Up,” in Proceedings of the 14th ACM-SIAM Symposium on
Discrete Algorithms (SODA 2003), 2003.'
mla: 'Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs:
Branch-Width and Exponential Speed-Up.” Proceedings of the 14th ACM-SIAM Symposium
on Discrete Algorithms (SODA 2003), 2003, doi:10.1137/s0097539702419649.'
short: 'F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium
on Discrete Algorithms (SODA 2003), 2003.'
date_created: 2020-10-08T10:31:48Z
date_updated: 2022-01-06T06:54:16Z
department:
- _id: '63'
doi: 10.1137/s0097539702419649
language:
- iso: eng
publication: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003)
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up'
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '24273'
author:
- first_name: Martina
full_name: Terbahl, Martina
last_name: Terbahl
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
citation:
ama: 'Terbahl M, Krokowski J. Verteiltes Rendern durch dynamische Bildaufteilung.
In: Proceedings of 5. GI-Informatiktage 2003. ; 2003.'
apa: Terbahl, M., & Krokowski, J. (2003). Verteiltes Rendern durch dynamische
Bildaufteilung. Proceedings of 5. GI-Informatiktage 2003.
bibtex: '@inproceedings{Terbahl_Krokowski_2003, place={Bad Schussenried, Germany},
title={Verteiltes Rendern durch dynamische Bildaufteilung}, booktitle={Proceedings
of 5. GI-Informatiktage 2003}, author={Terbahl, Martina and Krokowski, Jens},
year={2003} }'
chicago: Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische
Bildaufteilung.” In Proceedings of 5. GI-Informatiktage 2003. Bad Schussenried,
Germany, 2003.
ieee: M. Terbahl and J. Krokowski, “Verteiltes Rendern durch dynamische Bildaufteilung,”
2003.
mla: Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische
Bildaufteilung.” Proceedings of 5. GI-Informatiktage 2003, 2003.
short: 'M. Terbahl, J. Krokowski, in: Proceedings of 5. GI-Informatiktage 2003,
Bad Schussenried, Germany, 2003.'
date_created: 2021-09-13T12:06:43Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
language:
- iso: eng
place: Bad Schussenried, Germany
publication: Proceedings of 5. GI-Informatiktage 2003
status: public
title: Verteiltes Rendern durch dynamische Bildaufteilung
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '26263'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. Stability versus Speed in a Computable Algebraic Model. In: Proc.
5th Conference on Real Numbers and Computers (RNC5), INRIA. ; 2003:47-64.'
apa: Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model.
Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 47–64.
bibtex: '@inproceedings{Ziegler_2003, title={Stability versus Speed in a Computable
Algebraic Model}, booktitle={Proc. 5th Conference on Real Numbers and Computers
(RNC5), INRIA}, author={Ziegler, Martin}, year={2003}, pages={47–64} }'
chicago: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
In Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 47–64,
2003.
ieee: M. Ziegler, “Stability versus Speed in a Computable Algebraic Model,” in Proc.
5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64.
mla: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003,
pp. 47–64.
short: 'M. Ziegler, in: Proc. 5th Conference on Real Numbers and Computers (RNC5),
INRIA, 2003, pp. 47–64.'
date_created: 2021-10-15T11:00:14Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: 47-64
publication: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA
status: public
title: Stability versus Speed in a Computable Algebraic Model
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '26277'
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 302-8/2003. Informatik Berichte. ; 2003:389-406.'
apa: Ziegler, M. (2003). Computable Operators on Regular Sets. Computability
and Complexity in Analysis, 302-8/2003, 389–406.
bibtex: '@inproceedings{Ziegler_2003, series={Informatik Berichte}, title={Computable
Operators on Regular Sets}, volume={302–8/2003}, booktitle={Computability and
Complexity in Analysis}, author={Ziegler, Martin}, year={2003}, pages={389–406},
collection={Informatik Berichte} }'
chicago: Ziegler, Martin. “Computable Operators on Regular Sets.” In Computability
and Complexity in Analysis, 302-8/2003:389–406. Informatik Berichte, 2003.
ieee: M. Ziegler, “Computable Operators on Regular Sets,” in Computability and
Complexity in Analysis, 2003, vol. 302–8/2003, pp. 389–406.
mla: Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and
Complexity in Analysis, vol. 302-8/2003, 2003, pp. 389–406.
short: 'M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406.'
date_created: 2021-10-15T12:13:22Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: 389-406
publication: Computability and Complexity in Analysis
series_title: Informatik Berichte
status: public
title: Computable Operators on Regular Sets
type: conference
user_id: '15415'
volume: 302-8/2003
year: '2003'
...
---
_id: '2128'
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed
Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science.
Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17'
apa: Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler,
C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171).
Springer. https://doi.org/10.1007/978-3-540-39658-1_17
bibtex: '@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003,
series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity},
volume={2832}, DOI={10.1007/978-3-540-39658-1_17},
booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf
der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian},
year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science}
}'
chicago: Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian
Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA,
2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.
ieee: V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler,
“Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.
mla: Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832,
Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler,
in: ESA, Springer, 2003, pp. 161--171.'
date_created: 2018-04-03T05:37:10Z
date_updated: 2022-01-06T06:54:52Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-540-39658-1_17
intvolume: ' 2832'
language:
- iso: eng
page: 161--171
publication: ESA
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Smoothed Motion Complexity
type: conference
user_id: '14955'
volume: 2832
year: '2003'
...
---
_id: '2129'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems:
Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer
Science. Springer; 2003:1153--1168.'
apa: 'Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial
Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168).
Springer.'
bibtex: '@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes
in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission
Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch,
Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168},
collection={Lecture Notes in Computer Science} }'
chicago: 'Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting
in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168.
Lecture Notes in Computer Science. Springer, 2003.'
ieee: 'B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial
Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp.
1153--1168.'
mla: 'Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission
Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.'
short: 'B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp.
1153--1168.'
date_created: 2018-04-03T05:38:36Z
date_updated: 2022-01-06T06:54:53Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:04:48Z
date_updated: 2018-04-12T09:04:48Z
file_id: '2307'
file_name: ICALP-03.pdf
file_size: 154427
relation: main_file
file_date_updated: 2018-04-12T09:04:48Z
has_accepted_license: '1'
intvolume: ' 2719'
language:
- iso: eng
oa: '1'
page: 1153--1168
publication: ICALP
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Anycasting in Adversarial Systems: Routing and Admission Control'
type: conference
urn: '21297'
user_id: '14955'
volume: 2719
year: '2003'
...
---
_id: '17423'
author:
- first_name: Bengt
full_name: Mueck, Bengt
last_name: Mueck
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the
Analysis of Material Flow Simulations in a Virtual Environment. In: 15th European
Simulation Symposium (ESS 2003). SCS - Europe; 2003:367-371.'
apa: Mueck, B., Dangelmaier, W., & Fischer, M. (2003). Components for the Active
Support of the Analysis of Material Flow Simulations in a Virtual Environment.
In 15th European Simulation Symposium (ESS 2003) (pp. 367–371). SCS - Europe.
bibtex: '@inproceedings{Mueck_Dangelmaier_Fischer_2003, title={Components for the
Active Support of the Analysis of Material Flow Simulations in a Virtual Environment},
booktitle={15th European Simulation Symposium (ESS 2003)}, publisher={SCS - Europe},
author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2003},
pages={367–371} }'
chicago: Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for
the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.”
In 15th European Simulation Symposium (ESS 2003), 367–71. SCS - Europe,
2003.
ieee: B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support
of the Analysis of Material Flow Simulations in a Virtual Environment,” in 15th
European Simulation Symposium (ESS 2003), 2003, pp. 367–371.
mla: Mueck, Bengt, et al. “Components for the Active Support of the Analysis of
Material Flow Simulations in a Virtual Environment.” 15th European Simulation
Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–71.
short: 'B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium
(ESS 2003), SCS - Europe, 2003, pp. 367–371.'
date_created: 2020-07-28T08:05:14Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
language:
- iso: eng
page: 367-371
publication: 15th European Simulation Symposium (ESS 2003)
publisher: SCS - Europe
status: public
title: Components for the Active Support of the Analysis of Material Flow Simulations
in a Virtual Environment
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18791'
abstract:
- lang: eng
text: We consider the problem of finding the weight of a Euclidean minimum spanning
tree for a set of n points in ℝd. We focus on the situation when 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 + ε using only \~{O}(√ poly(1/ε))
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 neighbors queries.
author:
- first_name: Avner
full_name: Magen, Avner
last_name: Magen
- first_name: Funda
full_name: Ergun, Funda
last_name: Ergun
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Ronitt
full_name: Rubinfeld, Ronitt
last_name: Rubinfeld
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Ilan
full_name: Newman, Ilan
last_name: Newman
- first_name: Lance
full_name: Fortnow, Lance
last_name: Fortnow
citation:
ama: 'Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum
Spanning Tree. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms
(SODA 2003). ; 2003:813–822.'
apa: Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &
Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree.
In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003) (pp. 813–822).
bibtex: '@inproceedings{Magen_Ergun_Sohler_Rubinfeld_Czumaj_Newman_Fortnow_2003,
title={Sublinear Approximation of Euclidean Minimum Spanning Tree}, booktitle={Proceedings
of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Magen,
Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj,
Artur and Newman, Ilan and Fortnow, Lance}, year={2003}, pages={813–822} }'
chicago: Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj,
Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum
Spanning Tree.” In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms
(SODA 2003), 813–822, 2003.
ieee: A. Magen et al., “Sublinear Approximation of Euclidean Minimum Spanning
Tree,” in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms
(SODA 2003), 2003, pp. 813–822.
mla: Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning
Tree.” Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003), 2003, pp. 813–822.
short: 'A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow,
in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003),
2003, pp. 813–822.'
date_created: 2020-09-01T14:15:33Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
language:
- iso: eng
page: 813–822
publication: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003)
publication_identifier:
isbn:
- '0898715385'
status: public
title: Sublinear Approximation of Euclidean Minimum Spanning Tree
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18907'
abstract:
- lang: eng
text: In a (randomized) oblivious routing scheme the path chosen for a request
between
a source $s$ and a target $t$ is independent from the current traffic
in the
network. Hence, such a scheme consists of probability distributions
over $s-t$
paths for every source-target pair $s,t$ in the network.
In a recent result
citeR02 it was shown that for any undirected network
there is an oblivious
routing scheme that achieves a polylogarithmic
competitive ratio with respect
to congestion. Subsequently, Azar et
al. citeACF+03 gave a polynomial time
algorithm that for a given network
constructs the best oblivious routing scheme,
i.e. the scheme that guarantees
the best possible competitive ratio.
Unfortunately,
the latter result is based on the Ellipsoid algorithm; hence
it is unpractical
for large networks.
In this paper we present a combinatorial algorithm
for constructing an
oblivious routing scheme that guarantees a competitive
ratio of $O(log^4n)$
for undirected networks. Furthermore, our approach yields
a proof
for the existence of an oblivious routing scheme with competitive
ratio
$O(log^3n)$, which is much simpler than the original proof from citeR02.
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
citation:
ama: 'Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing
oblivious routing schemes. In: Proceedings of the Fifteenth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’03. ; 2003. doi:10.1145/777412.777418'
apa: Bienkowski, M., Korzeniowski, M., & Räcke, H. (2003). A practical algorithm
for constructing oblivious routing schemes. In Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03.
https://doi.org/10.1145/777412.777418
bibtex: '@inproceedings{Bienkowski_Korzeniowski_Räcke_2003, title={A practical algorithm
for constructing oblivious routing schemes}, DOI={10.1145/777412.777418},
booktitle={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’03}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw
and Räcke, Harald}, year={2003} }'
chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical
Algorithm for Constructing Oblivious Routing Schemes.” In Proceedings of the
Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA
’03, 2003. https://doi.org/10.1145/777412.777418.
ieee: M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing
oblivious routing schemes,” in Proceedings of the fifteenth annual ACM symposium
on Parallel algorithms and architectures - SPAA ’03, 2003.
mla: Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious
Routing Schemes.” Proceedings of the Fifteenth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’03, 2003, doi:10.1145/777412.777418.
short: 'M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03, 2003.'
date_created: 2020-09-03T07:44:01Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1145/777412.777418
language:
- iso: eng
publication: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA '03
publication_identifier:
isbn:
- '1581136617'
publication_status: published
status: public
title: A practical algorithm for constructing oblivious routing schemes
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18947'
abstract:
- lang: eng
text: In this paper, we define a Petri net model for the network or routing layer
of a mobile ad hoc network. Such networks require routing strategies substantially
different from those used in static communication networks. The model pre- sented
consists of two layers, a location service and a po- sition based routing. Both
are described in detail. Our ap- proach considers a very strong definition of
fault tolerance thereby improving state-of-the-art ad hoc routing protocols in
several respects. Modeling of the communication archi- tecture for mobile ad hoc
networks is part of our overall effort towards a design methodology for distributed
embed- ded real-time systems including dynamically evolving com- ponents.
author:
- first_name: Carsten
full_name: Rust, Carsten
last_name: Rust
- first_name: Friedhelm
full_name: Stappert, Friedhelm
last_name: Stappert
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: 'Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of
a Mobile Ad Hoc Network Architecture. In: 7th World Multiconference on Systemics,
Cybernetics and Informatics. ; 2003.'
apa: Rust, C., Stappert, F., & Lukovszki, T. (2003). A Petri Net Model for the
Network Layer of a Mobile Ad Hoc Network Architecture. In 7th World Multiconference
on Systemics, Cybernetics and Informatics.
bibtex: '@inproceedings{Rust_Stappert_Lukovszki_2003, title={A Petri Net Model for
the Network Layer of a Mobile Ad Hoc Network Architecture}, booktitle={7th World
Multiconference on Systemics, Cybernetics and Informatics}, author={Rust, Carsten
and Stappert, Friedhelm and Lukovszki, Tamás}, year={2003} }'
chicago: Rust, Carsten, Friedhelm Stappert, and Tamás Lukovszki. “A Petri Net Model
for the Network Layer of a Mobile Ad Hoc Network Architecture.” In 7th World
Multiconference on Systemics, Cybernetics and Informatics, 2003.
ieee: C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network
Layer of a Mobile Ad Hoc Network Architecture,” in 7th World Multiconference
on Systemics, Cybernetics and Informatics, 2003.
mla: Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile
Ad Hoc Network Architecture.” 7th World Multiconference on Systemics, Cybernetics
and Informatics, 2003.
short: 'C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics,
Cybernetics and Informatics, 2003.'
date_created: 2020-09-03T11:50:06Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
language:
- iso: eng
publication: 7th World Multiconference on Systemics, Cybernetics and Informatics
status: public
title: A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18960'
abstract:
- lang: eng
text: We investigate distributed algorithms for mobile ad hoc networks for moving
radio stations with adjustable transmission power in a worst case scenario.
We consider two models to find a reasonable restriction on the worst-case mobility.
In the pedestrian model we assume a maximum speed $v_max$ of the radio stations,
while in the vehicular model we assume a maximum acceleration $a_max$ of the
points. Our goal is to maintain persistent routes with nice communication network
properties like hop-distance, energy-consumption, congestion and number of interferences.
A route is persistent, if we can guarantee that all edges of this route can
be uphold for a given time span $Delta$, which is a parameter denoting the minimum
time the mobile network needs to adopt changes, i.e. update routing tables,
change directory entries, etc. This $Delta$ can be used as the length of an
update interval for a proactive routing scheme. We extend some known notions
such as transmission range, interferences, spanner, power spanner and congestion
to both mobility models and introduce a new parameter called crowdedness that
states a lower bound on the number of radio interferences. Then we prove that
a mobile spanner hosts a path system that polylogarithmically approximates the
optimal congestion. We present distributed algorithms based on a grid clustering technique
and a high-dimensional representation of the dynamical start situation which
construct mobile spanners with low congestion, low interference number, low
energy-consumption, and low degree. We measure the optimality of the output
of our algorithm by comparing it with the optimal choice of persistent routes
under the same circumstances with respect to pedestrian or vehicular worst-case movements.
Finally, we present solutions for dynamic position information management under
our mobility models.
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in
ad hoc networks. In: Proc. of the 15th ACM Symposium on Parallel Algorithms
and Architectures (SPAA03). ; 2003. doi:10.1145/777412.777448'
apa: Schindelhauer, C., Lukovszki, T., Rührup, S., & Volbert, K. (2003). Worst
case mobility in ad hoc networks. In Proc. of the 15th ACM Symposium on Parallel
Algorithms and Architectures (SPAA03). https://doi.org/10.1145/777412.777448
bibtex: '@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst
case mobility in ad hoc networks}, DOI={10.1145/777412.777448},
booktitle={Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures
(SPAA03)}, author={Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan
and Volbert, Klaus}, year={2003} }'
chicago: Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert.
“Worst Case Mobility in Ad Hoc Networks.” In Proc. of the 15th ACM Symposium
on Parallel Algorithms and Architectures (SPAA03), 2003. https://doi.org/10.1145/777412.777448.
ieee: C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility
in ad hoc networks,” in Proc. of the 15th ACM Symposium on Parallel Algorithms
and Architectures (SPAA03), 2003.
mla: Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.”
Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03),
2003, doi:10.1145/777412.777448.
short: 'C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the
15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.'
date_created: 2020-09-03T13:10:50Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1145/777412.777448
language:
- iso: eng
publication: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures
(SPAA03)
publication_identifier:
isbn:
- '1581136617'
publication_status: published
status: public
title: Worst case mobility in ad hoc networks
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18966'
abstract:
- lang: eng
text: A recent seminal result of Räcke is that for any undirected network there
is an oblivious routing algorithm with a polylogarithmic competitive ratio with
respect to congestion. Unfortunately, Räcke's construction is not polynomial time.
We give a polynomial time construction that guarantees Räcke's bounds, and more
generally gives the true optimal ratio for any (undirected or directed) network.
author:
- first_name: Yossi
full_name: Azar, Yossi
last_name: Azar
- first_name: Edith
full_name: Cohen, Edith
last_name: Cohen
- first_name: Amos
full_name: Fiat, Amos
last_name: Fiat
- first_name: Haim
full_name: Kaplan, Haim
last_name: Kaplan
- first_name: Harald
full_name: Racke, Harald
last_name: Racke
citation:
ama: 'Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial
time. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing
- STOC ’03. ; 2003. doi:10.1145/780542.780599'
apa: Azar, Y., Cohen, E., Fiat, A., Kaplan, H., & Racke, H. (2003). Optimal
oblivious routing in polynomial time. In Proceedings of the thirty-fifth ACM
symposium on Theory of computing - STOC ’03. https://doi.org/10.1145/780542.780599
bibtex: '@inproceedings{Azar_Cohen_Fiat_Kaplan_Racke_2003, title={Optimal oblivious
routing in polynomial time}, DOI={10.1145/780542.780599},
booktitle={Proceedings of the thirty-fifth ACM symposium on Theory of computing
- STOC ’03}, author={Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim
and Racke, Harald}, year={2003} }'
chicago: Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal
Oblivious Routing in Polynomial Time.” In Proceedings of the Thirty-Fifth ACM
Symposium on Theory of Computing - STOC ’03, 2003. https://doi.org/10.1145/780542.780599.
ieee: Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing
in polynomial time,” in Proceedings of the thirty-fifth ACM symposium on Theory
of computing - STOC ’03, 2003.
mla: Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.” Proceedings
of the Thirty-Fifth ACM Symposium on Theory of Computing - STOC ’03, 2003,
doi:10.1145/780542.780599.
short: 'Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the
Thirty-Fifth ACM Symposium on Theory of Computing - STOC ’03, 2003.'
date_created: 2020-09-03T14:34:33Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
doi: 10.1145/780542.780599
language:
- iso: eng
publication: Proceedings of the thirty-fifth ACM symposium on Theory of computing -
STOC '03
publication_identifier:
isbn:
- '1581136749'
publication_status: published
status: public
title: Optimal oblivious routing in polynomial time
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18982'
abstract:
- lang: ger
text: In dieser Studienarbeit wurde ein System entworfen und implementiert, das
der Ausführung paralleler Algorithmen nach dem Bulk-Synchronous Parallel (BSP)-Modell
dient. Von der Paderborn University BSP Library (PUB) unterscheidet es sich dadurch,
dass es vom Einsatzgebiet her nicht für Parallelrechner konzipiert ist, sondern
vielmehr für eine Ansammlung von PCs und Workstations, die über das gesamte Internet
verteilt sind.
Gegenüber anderen bekannten Web-Computing Projekten wie z.B.
SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht
Clients von einem zentralen Server "häppchenweise" unabhängige Teilprobleme anfordern
und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem
sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren.
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: Gehweiler J. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele
Algorithmen in Java. Universität Paderborn; 2003.
apa: Gehweiler, J. (2003). Entwurf und Implementierung einer Laufzeitumgebung
für parallele Algorithmen in Java. Universität Paderborn.
bibtex: '@book{Gehweiler_2003, place={Universität Paderborn}, title={Entwurf und
Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}, author={Gehweiler,
Joachim}, year={2003} }'
chicago: Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung
Für Parallele Algorithmen in Java. Universität Paderborn, 2003.
ieee: J. Gehweiler, Entwurf und Implementierung einer Laufzeitumgebung für parallele
Algorithmen in Java. Universität Paderborn, 2003.
mla: Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für
Parallele Algorithmen in Java. 2003.
short: J. Gehweiler, Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele
Algorithmen in Java, Universität Paderborn, 2003.
date_created: 2020-09-04T08:03:37Z
date_updated: 2022-01-06T06:53:56Z
ddc:
- '004'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-04T08:03:11Z
date_updated: 2020-09-04T08:03:11Z
file_id: '18985'
file_name: pub-hni-2464.pdf
file_size: 703144
relation: main_file
success: 1
file_date_updated: 2020-09-04T08:03:11Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
title: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen
in Java
type: mastersthesis
user_id: '15415'
year: '2003'
...
---
_id: '20435'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. Complex
Systems. 2003;14(3):263--268.
apa: Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions.
Complex Systems, 14(3), 263--268.
bibtex: '@article{Hamann_2003, title={Definition and Behavior of Langton’s Ant in
Three Dimensions}, volume={14}, number={3}, journal={Complex Systems}, author={Hamann,
Heiko}, year={2003}, pages={263--268} }'
chicago: 'Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.”
Complex Systems 14, no. 3 (2003): 263--268.'
ieee: H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,”
Complex Systems, vol. 14, no. 3, pp. 263--268, 2003.
mla: Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.”
Complex Systems, vol. 14, no. 3, 2003, pp. 263--268.
short: H. Hamann, Complex Systems 14 (2003) 263--268.
date_created: 2020-11-19T12:15:45Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
intvolume: ' 14'
issue: '3'
language:
- iso: eng
page: 263--268
publication: Complex Systems
status: public
title: Definition and Behavior of Langton's Ant in Three Dimensions
type: journal_article
user_id: '15415'
volume: 14
year: '2003'
...
---
_id: '18196'
abstract:
- lang: eng
text: Fast algorithms for arithmetic on real or complex polynomials are well-known
and have proven to be not only asymptotically efficient but also very practical.
Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of
degree up to N or multi-evaluate one at N points simultaneously within quasi-linear
time O(N polylog N). An extension to (and in fact the mere definition of) polynomials
over fields R and C to the SKEW-field H of quaternions is promising but still
missing. The present work proposes three approaches which in the commutative case
coincide but for H turn out to differ, each one satisfying some desirable properties
while lacking others. For each notion, we devise algorithms for according arithmetic;
these are quasi-optimal in that their running times match lower complexity bounds
up to polylogarithmic factors.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: Proc.
14th Annual International Symposium on Algorithms and Computation (ISAAC’03).
Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715.
doi:10.1007/978-3-540-24587-2_72'
apa: Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In
Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)
(pp. 705–715). https://doi.org/10.1007/978-3-540-24587-2_72
bibtex: '@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science,
vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion
Polynomials}, DOI={10.1007/978-3-540-24587-2_72},
booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation
(ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture
Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }'
chicago: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”
In Proc. 14th Annual International Symposium on Algorithms and Computation
(ISAAC’03), 705–15. Lecture Notes in Computer Science, Vol 2906. Springer,
Berlin, Heidelberg, 2003. https://doi.org/10.1007/978-3-540-24587-2_72.
ieee: M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in Proc.
14th Annual International Symposium on Algorithms and Computation (ISAAC’03),
2003, pp. 705–715.
mla: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” Proc.
14th Annual International Symposium on Algorithms and Computation (ISAAC’03),
2003, pp. 705–15, doi:10.1007/978-3-540-24587-2_72.
short: 'M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms
and Computation (ISAAC’03), 2003, pp. 705–715.'
date_created: 2020-08-24T14:18:19Z
date_updated: 2022-01-06T06:53:27Z
department:
- _id: '63'
doi: 10.1007/978-3-540-24587-2_72
language:
- iso: eng
page: 705-715
publication: Proc. 14th Annual International Symposium on Algorithms and Computation
(ISAAC'03)
publication_identifier:
isbn:
- '9783540206958'
- '9783540245872'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg
status: public
title: Quasi-optimal Arithmetic for Quaternion Polynomials
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18258'
abstract:
- lang: eng
text: Multi-evaluation of the Coulomb potential induced by N particles is a central
part of N-body simulations. In 3D, known subquadratic time algorithms return approximations
up to given ABSOLUTE precision. By combining data structures from Computational
Geometry with fast polynomial arithmetic, the present work obtains approximations
of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack
J, Smid M, Algorithms and Data Structures. WADS 2003, eds. Lecture Notes in
Computer Science. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer; 2003. doi:10.1007/978-3-540-45078-8_13'
apa: 'Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F.
Dehne, J. Sack, M. Smid, & Algorithms and Data Structures. WADS 2003 (Eds.),
Lecture Notes in Computer Science (Vol. 2748). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-540-45078-8_13'
bibtex: '@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes
in Computer Science}, title={Fast Relative Approximation of Potential Fields},
volume={2748}, DOI={10.1007/978-3-540-45078-8_13},
booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler,
Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data
Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In
Lecture Notes in Computer Science, edited by F. Dehne, JR. Sack, M. Smid,
and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer
Science. Berlin, Heidelberg: Springer, 2003. https://doi.org/10.1007/978-3-540-45078-8_13.'
ieee: 'M. Ziegler, “Fast Relative Approximation of Potential Fields,” in Lecture
Notes in Computer Science, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms
and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.'
mla: Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” Lecture
Notes in Computer Science, edited by F. Dehne et al., vol. 2748, Springer,
2003, doi:10.1007/978-3-540-45078-8_13.
short: 'M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures.
WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg,
2003.'
corporate_editor:
- Algorithms and Data Structures. WADS 2003
date_created: 2020-08-25T10:15:14Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1007/978-3-540-45078-8_13
editor:
- first_name: F.
full_name: Dehne, F.
last_name: Dehne
- first_name: JR.
full_name: Sack, JR.
last_name: Sack
- first_name: M.
full_name: Smid, M.
last_name: Smid
intvolume: ' 2748'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540405450'
- '9783540450788'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Fast Relative Approximation of Potential Fields
type: book_chapter
user_id: '15415'
volume: 2748
year: '2003'
...
---
_id: '18367'
abstract:
- lang: eng
text: "Unternehmen operieren zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik
nimmt zu; die Produktlebenszyklen werden kürzer; gleichzeitig werden die Produkte
komplexer; der harte Wettbewerb zwingt die Unternehmen, auf Marktveränderungen
zu reagieren. Aus dieser Entwicklung resultieren hohe Anforderungen an die Gestaltung
der Fertigungsprozesse. Im Wesentlichen kommt es darauf an, die Fertigungsprozesse
möglichst rasch an die neuen Gegebenheiten anzupassen, bzw. neue Fertigungsprozesse
so zu planen, dass sie auf Anhieb die erforderlichen Resultate bringen.\r\nEin
wichtiges Mittel hierfür der Einsatz von Materialflusssimulationen. Hierzu ist
zunächst die Erstellung eines Simulationsmodells notwendig. Dafür wird in einem
ersten Schritt das zu betrachtende System analysiert und ein rechnerinternes Modell
erzeugt. Dieses beinhaltet die Modellierung von Funktionen, Prozessen, Verhaltensweisen
oder Regeln, die im Modell die tatsächlichen Wirkzusammenhänge im Unternehmen
widerspiegeln sollen. Die so modellierten Aspekte sind untereinander so vernetzt,
dass alle Funktionen des Modells ein Ganzes ergeben. Für viele Fragenstellungen
werden umfangreiche Modelle mit einem komplexen Verhalten benötigt. Andererseits
steigt mit zunehmender Größe und Komplexität des Simulationsmodells auch der Modellierungsaufwand,
die Fehleranfälligkeit, die Laufzeit und der Interpretationsaufwand bei der Ergebnisauswertung.
Fehler bei der Modellbildung führen bei der Simulation zu Fehlinterpretationen
und falschen Ergebnissen.\r\nEinen wesentlichen Anteil daran hat die Gestaltung
der Benutzungsschnittstelle: Das übliche, wenig intuitive WIMP-Interface (Windows,
Icons, Mouse, Pointer) erfordert sehr gut geschulte Benutzer, sodass die Erzeugung
der meist komplexen Simulationsmodelle mit großen Zeitaufwand verbunden ist. Die
Präsentation der Simulationsergebnisse erfolgt in Form von Wertetabellen und zweidimensionalen,
abstrakten Darstellungen des Fertigungssystems. Für die Simulationsexperten erscheint
dies ausreichend, für ein aus verschiedenen Bereichen und Disziplinen zusammengesetztes
Planungsteam ist das aber nicht akzeptabel. So können Fehlinterpretationen aufgrund
der unklaren Darstellungen auftreten.\r\nDurch eine durchgängige Unterstützung
von der Modellierung über die Ausführung bis zur Analyse von Simulationen durch
Augmented-Reality und Virtual-Reality werden viele dieser Probleme überwunden
aber viele neue Probleme entstehen.\r\nMarktgängige Simulatoren unterstützen zwar
z.T. schon Virtual Reality; eine durchgängige Simulationsunterstützung wird aber
in der Virtuellen Umgebung nicht geboten. Argumented Reality-Komponenten sind
bisher nicht bekannt.\r\nIn diesem Artikel werden nach einer Analyse der benötigten
Technologien die Nutzenpotentiale insb. durch den Einsatz von AR ausgelotet.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- 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
- first_name: Michael
full_name: Schoo, Michael
last_name: Schoo
citation:
ama: 'Fischer M, Grafe M, Matysczok C, Mueck B, Schoo M. Virtual and Augmented Reality
Support for Discrete Manufacturing System Simulation. In: Human Aspects in
Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human
Aspects in Production Management. Vol 5. ESIM - European Series in Industrial
Management. Karlsruhe: Shaker Verlag; 2003:170-177.'
apa: 'Fischer, M., Grafe, M., Matysczok, C., Mueck, B., & Schoo, M. (2003).
Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.
In Human Aspects in Production Management - Proceedings of the IFIP WG 5.7
Working Conference on Human Aspects in Production Management (Vol. 5, pp.
170–177). Karlsruhe: Shaker Verlag.'
bibtex: '@inproceedings{Fischer_Grafe_Matysczok_Mueck_Schoo_2003, place={Karlsruhe},
series={ESIM - European Series in Industrial Management}, title={Virtual and Augmented
Reality Support for Discrete Manufacturing System Simulation}, volume={5}, booktitle={Human
Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference
on Human Aspects in Production Management}, publisher={Shaker Verlag}, author={Fischer,
Matthias and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt and Schoo,
Michael}, year={2003}, pages={170–177}, collection={ESIM - European Series in
Industrial Management} }'
chicago: 'Fischer, Matthias, Michael Grafe, Carsten Matysczok, Bengt Mueck, and
Michael Schoo. “Virtual and Augmented Reality Support for Discrete Manufacturing
System Simulation.” In Human Aspects in Production Management - Proceedings
of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management,
5:170–77. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag,
2003.'
ieee: M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “Virtual and Augmented
Reality Support for Discrete Manufacturing System Simulation,” in Human Aspects
in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on
Human Aspects in Production Management, 2003, vol. 5, pp. 170–177.
mla: Fischer, Matthias, et al. “Virtual and Augmented Reality Support for Discrete
Manufacturing System Simulation.” Human Aspects in Production Management -
Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production
Management, vol. 5, Shaker Verlag, 2003, pp. 170–77.
short: 'M. Fischer, M. Grafe, C. Matysczok, B. Mueck, M. Schoo, in: Human Aspects
in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on
Human Aspects in Production Management, Shaker Verlag, Karlsruhe, 2003, pp. 170–177.'
date_created: 2020-08-26T12:53:13Z
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:52:18Z
date_updated: 2020-08-26T12:52:18Z
file_id: '18368'
file_name: hni-id-1445.pdf
file_size: 221846
relation: main_file
success: 1
file_date_updated: 2020-08-26T12:52:18Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
page: 170-177
place: Karlsruhe
publication: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7
Working Conference on Human Aspects in Production Management
publisher: Shaker Verlag
series_title: ESIM - European Series in Industrial Management
status: public
title: Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation
type: conference
user_id: '15415'
volume: 5
year: '2003'
...
---
_id: '18372'
abstract:
- lang: ger
text: "Simulation und Visualisierung sind anerkannte Mittel zum Verstehen und Analysieren
von Fertigungsprozessen. In Visualisierungen von Fertigungsprozessen können Betrachter
frei und ungeleitet umherwandern. Erkenntnisse werden so aber eher zufällig erworben.
Dieser Artikel skizziert ein System und Methoden, die den Betrachter unterstützen
auf auffällige/signifikante Prozesse/ Punkte in Materialflusssimulationen aufmerksam
zu werden und diese zu entschärfen.\r\nEs wird der Entwurf eines Werkzeugs beschrieben,
dass den Betrachter einer Simulation die Möglichkeit bietet, signifikante Produktionsprozesse
interaktiv zu verbessern. Der Benutzer wird sich in einer virtuellen 3D-Umgebung
(Walkthrough-System) bewegen können und automatisch ermittelte Indizien für signifikante
Abläufe erhalten. Zugleich soll die Simulation signifikante Objekte genauer simulieren.
Bekundet der Benutzer Interesse an einem signifikanten Prozess, wird er automatisch
zu dem jeweiligen Ort geführt werden und dort durch Eingriffe in die Simulation
die kritische Situation experimentell untersuchen können. Da der kritische Moment
in der Vergangenheit liegt und somit vom Betrachter schon verpasst ist, wird es
dem Betrachter möglich sein, die Simulation auf einen Zeitpunkt vor dem Eintreten
zurück zu setzen.\r\nDie virtuelle Szene (3D-Grafik-Modelle) einer typischen dynamischen
Simulationsumgebung ist in der Regel zu komplex, um sie in Echtzeit in einem Walkthrough-System
zu visualisieren und darzustellen. Typischerweise werden Approximationsverfahren
eingesetzt, um die Komplexität zu reduzieren und ein flüssiges Navigieren des
Betrachters zu erlauben. Durch spezifische Simulations-Anforderungen ist bekannt,
an welchen Objekten des Simulationsmodells Probleme auftreten; sie sind für den
Betrachter wichtig. Die zugehörigen virtuellen 3D-Repräsentanten, können von den
Approximationsalgorithmen mit einer besonders hohen Darstellungsqualität dargestellt
werden und die übrigen Teile der virtuellen Szene entsprechend vernachlässigt
werden. Solche Approximationsalgorithmen und Datenstrukturen nutzen die spezifischen
Eigenschaften virtueller Simulationsumgebungen aus, um eine hohe Darstellungsqualität
und Darstellungsperformance zu erreichen.\r\n"
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Werner
full_name: ' Franke, Werner'
last_name: ' Franke'
- first_name: Bengt
full_name: Mueck, Bengt
last_name: Mueck
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Dangelmaier W, Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung
der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: 2.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.'
apa: Dangelmaier, W., Franke, W., Mueck, B., & Fischer, M. (2003). Komponenten
zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen
Umgebungen. In 2. Paderborner Workshop Augmented & Virtual Reality in der
Produktentstehung (Vol. 123, pp. 141–151).
bibtex: '@inproceedings{Dangelmaier_ Franke_Mueck_Fischer_2003, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Komponenten zur aktiven Unterstützung
der Analyse von Materialflusssimulationen in virtuellen Umgebungen}, volume={123},
booktitle={2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung},
author={Dangelmaier, Wilhelm and Franke, Werner and Mueck, Bengt and Fischer,
Matthias}, year={2003}, pages={141–151}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dangelmaier, Wilhelm, Werner Franke, Bengt Mueck, and Matthias Fischer.
“Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen
in Virtuellen Umgebungen.” In 2. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, 123:141–51. Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn, 2003.
ieee: W. Dangelmaier, W. Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven
Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,”
in 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2003, vol. 123, pp. 141–151.
mla: Dangelmaier, Wilhelm, et al. “Komponenten Zur Aktiven Unterstützung Der Analyse
von Materialflusssimulationen in Virtuellen Umgebungen.” 2. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, vol. 123, 2003,
pp. 141–51.
short: 'W. Dangelmaier, W. Franke, B. Mueck, M. Fischer, in: 2. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, 2003, pp. 141–151.'
date_created: 2020-08-26T13:16:08Z
date_updated: 2022-01-06T06:53:31Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T13:15:56Z
date_updated: 2020-08-26T13:15:56Z
file_id: '18373'
file_name: hni-id-1340.pdf
file_size: 166316
relation: main_file
success: 1
file_date_updated: 2020-08-26T13:15:56Z
has_accepted_license: '1'
intvolume: ' 123'
language:
- iso: eng
page: 141-151
publication: 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen
in virtuellen Umgebungen
type: conference
user_id: '15415'
volume: 123
year: '2003'
...
---
_id: '18374'
abstract:
- lang: ger
text: 'In der heutigen Zeit operieren Unternehmen zunehmend in einem schwierigen
Umfeld: Die Innovationsdynamik nimmt zu und die Produktlebenszyklen werden kürzer.
Daraus resultieren hohe Anforderungen an die Planung von Fertigungssysteme. Um
diesen Prozess zu unterstützen, sollen die Technologien Augmented Reality und
Virtual Reality in einem integrierten System genutzt werden. Dieses System unterstützt
den Anwender bei der Modellbildung, der Validierung des Simulationsmodells sowie
der folgenden Optimierung des Fertigungssystems. Durch die Entwicklung geeigneter
Kopplungs- bzw. Integrationsmechanismen wird eine durchgängige Nutzung der Technologien
AR, VR und Simulation realisiert. Die Visualisierung der anfallenden 3D-Daten
innerhalb der VR- und ARUmgebungen erfolgt mittels einer 3D-Renderinglibrary,
die es durch den Einsatz von neuen entwickelten Verfahren ermöglicht, die verwendeten
3D-Modelle weitgehend automatisiert aus unternehmensinternen 3D-CAD-Modellen zu
generieren.'
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Carsten
full_name: Matysczok, Carsten
last_name: Matysczok
- first_name: Michael
full_name: Schoo, Michael
last_name: Schoo
- first_name: Bengt
full_name: Mueck, Bengt
last_name: Mueck
citation:
ama: 'Fischer M, Grafe M, Matysczok C, Schoo M, Mueck B. Planung von komplexen Fertigungssystemen
durch Einsatz einer VR/AR-unterstützten Simulation. In: 2. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung. Vol 123. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn; 2003:153-166.'
apa: Fischer, M., Grafe, M., Matysczok, C., Schoo, M., & Mueck, B. (2003). Planung
von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation.
2. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
123, 153–166.
bibtex: '@inproceedings{Fischer_Grafe_Matysczok_Schoo_Mueck_2003, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Planung von komplexen Fertigungssystemen
durch Einsatz einer VR/AR-unterstützten Simulation}, volume={123}, booktitle={2.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer,
Matthias and Grafe, Michael and Matysczok, Carsten and Schoo, Michael and Mueck,
Bengt}, year={2003}, pages={153–166}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Fischer, Matthias, Michael Grafe, Carsten Matysczok, Michael Schoo, and
Bengt Mueck. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten
Simulation.” In 2. Paderborner Workshop Augmented & Virtual Reality in
Der Produktentstehung, 123:153–66. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2003.
ieee: M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen
Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in 2.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2003, vol. 123, pp. 153–166.
mla: Fischer, Matthias, et al. “Planung von Komplexen Fertigungssystemen Durch Einsatz
Einer VR/AR-Unterstützten Simulation.” 2. Paderborner Workshop Augmented &
Virtual Reality in Der Produktentstehung, vol. 123, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–66.
short: 'M. Fischer, M. Grafe, C. Matysczok, M. Schoo, B. Mueck, in: 2. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–166.'
date_created: 2020-08-26T13:24:57Z
date_updated: 2022-01-06T06:53:31Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T13:24:28Z
date_updated: 2020-08-26T13:24:28Z
file_id: '18375'
file_name: hni-id-1343.pdf
file_size: 906882
relation: main_file
success: 1
file_date_updated: 2020-08-26T13:24:28Z
has_accepted_license: '1'
intvolume: ' 123'
language:
- iso: eng
page: 153-166
publication: 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten
Simulation
type: conference
user_id: '5786'
volume: 123
year: '2003'
...
---
_id: '18567'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Naveen
full_name: Sivadasan, Naveen
last_name: Sivadasan
citation:
ama: Adler M, Vöcking B, Sohler C, Räcke H, Sivadasan N. Randomized Pursuit-Evasion
in Graphs. Combinatorics, Probability & Computing. 2003:225-244.
apa: Adler, M., Vöcking, B., Sohler, C., Räcke, H., & Sivadasan, N. (2003).
Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability & Computing,
225–244.
bibtex: '@article{Adler_Vöcking_Sohler_Räcke_Sivadasan_2003, title={Randomized Pursuit-Evasion
in Graphs}, journal={Combinatorics, Probability & Computing}, author={Adler,
Micah and Vöcking, Berthold and Sohler, Christian and Räcke, Harald and Sivadasan,
Naveen}, year={2003}, pages={225–244} }'
chicago: Adler, Micah, Berthold Vöcking, Christian Sohler, Harald Räcke, and Naveen
Sivadasan. “Randomized Pursuit-Evasion in Graphs.” Combinatorics, Probability
& Computing, 2003, 225–44.
ieee: M. Adler, B. Vöcking, C. Sohler, H. Räcke, and N. Sivadasan, “Randomized Pursuit-Evasion
in Graphs,” Combinatorics, Probability & Computing, pp. 225–244, 2003.
mla: Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Combinatorics,
Probability & Computing, 2003, pp. 225–44.
short: M. Adler, B. Vöcking, C. Sohler, H. Räcke, N. Sivadasan, Combinatorics, Probability
& Computing (2003) 225–244.
date_created: 2020-08-28T12:14:18Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 225-244
publication: Combinatorics, Probability & Computing
status: public
title: Randomized Pursuit-Evasion in Graphs
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '18573'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: Sohler C. Property Testing and Geometry. Vol 119. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2003.
apa: Sohler, C. (2003). Property Testing and Geometry (Vol. 119). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Sohler_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Property Testing and Geometry}, volume={119}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Sohler, Christian}, year={2003},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Sohler, Christian. Property Testing and Geometry. Vol. 119. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2003.
ieee: C. Sohler, Property Testing and Geometry, vol. 119. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2003.
mla: Sohler, Christian. Property Testing and Geometry. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2003.
short: C. Sohler, Property Testing and Geometry, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2003.
date_created: 2020-08-28T13:11:56Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 119'
language:
- iso: eng
publication_identifier:
isbn:
- 3-935433-28-X
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101281
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: Property Testing and Geometry
type: dissertation
user_id: '5786'
volume: 119
year: '2003'
...
---
_id: '16481'
abstract:
- lang: eng
text: 'ZusammenfassungVernetzte Systeme sind zu
unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner,
als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten
von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher
Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In
diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive
Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere
Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem
wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen
parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt
haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten
Datenservern führen.'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen
– Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design
Methods – Applications). it - Information Technology. 2003. doi:10.1524/itit.45.2.108.19606'
apa: 'Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications). It - Information Technology. https://doi.org/10.1524/itit.45.2.108.19606'
bibtex: '@article{Meyer auf der Heide_2003, title={Sonderforschungsbereich 376 Massive
Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel
Computing: Algorithms – Design Methods – Applications)}, DOI={10.1524/itit.45.2.108.19606},
journal={it - Information Technology}, author={Meyer auf der Heide, Friedhelm},
year={2003} }'
chicago: 'Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications).” It - Information Technology, 2003. https://doi.org/10.1524/itit.45.2.108.19606.'
ieee: 'F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications),” it - Information Technology, 2003.'
mla: 'Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications).” It - Information Technology, 2003, doi:10.1524/itit.45.2.108.19606.'
short: F. Meyer auf der Heide, It - Information Technology (2003).
date_created: 2020-04-09T07:27:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1524/itit.45.2.108.19606
language:
- iso: eng
publication: it - Information Technology
publication_identifier:
issn:
- 2196-7032
- 1611-2776
publication_status: published
status: public
title: 'Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden
– Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)'
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '16482'
author:
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on
parallel locality models. Journal of Discrete Algorithms. 2003:151-166.
doi:10.1016/s1570-8667(03)00023-6
apa: Juurlink, B., Kolman, P., Meyer auf der Heide, F., & Rieping, I. (2003).
Optimal broadcast on parallel locality models. Journal of Discrete Algorithms,
151–166. https://doi.org/10.1016/s1570-8667(03)00023-6
bibtex: '@article{Juurlink_Kolman_Meyer auf der Heide_Rieping_2003, title={Optimal
broadcast on parallel locality models}, DOI={10.1016/s1570-8667(03)00023-6},
journal={Journal of Discrete Algorithms}, author={Juurlink, Bernhardus and Kolman,
Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={2003}, pages={151–166}
}'
chicago: Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo
Rieping. “Optimal Broadcast on Parallel Locality Models.” Journal of Discrete
Algorithms, 2003, 151–66. https://doi.org/10.1016/s1570-8667(03)00023-6.
ieee: B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast
on parallel locality models,” Journal of Discrete Algorithms, pp. 151–166,
2003.
mla: Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.”
Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
short: B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete
Algorithms (2003) 151–166.
date_created: 2020-04-09T07:33:09Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/s1570-8667(03)00023-6
language:
- iso: eng
page: 151-166
publication: Journal of Discrete Algorithms
publication_identifier:
issn:
- 1570-8667
publication_status: published
status: public
title: Optimal broadcast on parallel locality models
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '16484'
citation:
ama: Rosenberg AL, Meyer auf der Heide F, eds. Proceedings of the Fifteenth Annual
ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03.; 2003.
doi:10.1145/777412
apa: Rosenberg, A. L., & Meyer auf der Heide, F. (Eds.). (2003). Proceedings
of the fifteenth annual ACM symposium on Parallel algorithms and architectures
- SPAA ’03. https://doi.org/10.1145/777412
bibtex: '@book{Rosenberg_Meyer auf der Heide_2003, title={Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03}, DOI={10.1145/777412}, year={2003} }'
chicago: Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, eds. Proceedings
of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’03, 2003. https://doi.org/10.1145/777412.
ieee: A. L. Rosenberg and F. Meyer auf der Heide, Eds., Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03.
2003.
mla: Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. Proceedings
of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’03. 2003, doi:10.1145/777412.
short: A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03, 2003.
date_created: 2020-04-09T07:41:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/777412
editor:
- first_name: Arnold L.
full_name: Rosenberg, Arnold L.
last_name: Rosenberg
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
language:
- iso: eng
publication_identifier:
isbn:
- '1581136617'
publication_status: published
status: public
title: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and
architectures - SPAA '03
type: conference_editor
user_id: '15415'
year: '2003'
...
---
_id: '16720'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: N.
full_name: Bruls, N.
last_name: Bruls
- first_name: U.
full_name: Kastens, U.
last_name: Kastens
- first_name: D. K.
full_name: Le, D. K.
last_name: Le
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: J.-C.
full_name: Niemann, J.-C.
last_name: Niemann
- first_name: M.
full_name: Porrmann, M.
last_name: Porrmann
- first_name: U.
full_name: Rückert, U.
last_name: Rückert
- first_name: A.
full_name: Slowik, A.
last_name: Slowik
- first_name: M.
full_name: Thies, M.
last_name: Thies
citation:
ama: 'Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network
processor design. In: 28th Annual IEEE International Conference on Local Computer
Networks. ; 2003. doi:10.1109/LCN.2003.1243185'
apa: Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann,
J.-C., … Thies, M. (2003). A holistic methodology for network processor design.
In 28th Annual IEEE International Conference on Local Computer Networks.
https://doi.org/10.1109/LCN.2003.1243185
bibtex: '@inproceedings{Bonorden_Bruls_Kastens_Le_Meyer auf der Heide_Niemann_Porrmann_Rückert_Slowik_Thies_2003,
title={A holistic methodology for network processor design}, DOI={10.1109/LCN.2003.1243185},
booktitle={28th Annual IEEE International Conference on Local Computer Networks},
author={Bonorden, Olaf and Bruls, N. and Kastens, U. and Le, D. K. and Meyer auf
der Heide, Friedhelm and Niemann, J.-C. and Porrmann, M. and Rückert, U. and Slowik,
A. and Thies, M.}, year={2003} }'
chicago: Bonorden, Olaf, N. Bruls, U. Kastens, D. K. Le, Friedhelm Meyer auf der
Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, and M. Thies. “A Holistic
Methodology for Network Processor Design.” In 28th Annual IEEE International
Conference on Local Computer Networks, 2003. https://doi.org/10.1109/LCN.2003.1243185.
ieee: O. Bonorden et al., “A holistic methodology for network processor design,”
in 28th Annual IEEE International Conference on Local Computer Networks,
2003.
mla: Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.”
28th Annual IEEE International Conference on Local Computer Networks, 2003,
doi:10.1109/LCN.2003.1243185.
short: 'O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C.
Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International
Conference on Local Computer Networks, 2003.'
date_created: 2020-04-17T08:31:57Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/LCN.2003.1243185
language:
- iso: eng
publication: 28th Annual IEEE International Conference on Local Computer Networks
status: public
title: A holistic methodology for network processor design
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19727'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested
BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In:
Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA). ; 2002:2202-2208.'
apa: 'Bonorden, O., Meyer auf der Heide, F., & Wanka, R. (2002). Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example. In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA) (pp. 2202–2208).'
bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques
and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2002}, pages={2202–2208} }'
chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example.” In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA), 2202–8, 2002.'
ieee: 'O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient
Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,”
in Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA), 2002, pp. 2202–2208.'
mla: 'Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum
Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp.
2202–08.'
short: 'O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.'
date_created: 2020-09-28T10:49:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
page: 2202-2208
publication: Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA)
status: public
title: 'Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation
as an Instructive Example'
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '19850'
author:
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
Graphs Is Asymptotically Optimal. In: Proc. Workshop on Graph-Theoretic Concepts
in Computer Science (WG). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36'
apa: Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations
on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_36
bibtex: '@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing
Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal},
DOI={10.1007/3-540-36379-3_36},
booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
author={Wanka, Rolf}, year={2002}, pages={413–420} }'
chicago: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations
on Circulant Graphs Is Asymptotically Optimal.” In Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-36379-3_36.
ieee: R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
Graphs Is Asymptotically Optimal,” in Proc. Workshop on Graph-Theoretic Concepts
in Computer Science (WG), 2002, pp. 413–420.
mla: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on
Circulant Graphs Is Asymptotically Optimal.” Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
short: 'R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science
(WG), Berlin, Heidelberg, 2002, pp. 413–420.'
date_created: 2020-10-02T11:16:31Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/3-540-36379-3_36
language:
- iso: eng
page: 413-420
place: Berlin, Heidelberg
publication: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)
publication_identifier:
isbn:
- '9783540003311'
- '9783540363798'
issn:
- 0302-9743
publication_status: published
status: public
title: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs
Is Asymptotically Optimal
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '19873'
abstract:
- lang: eng
text: We present a new and easy to use framework for navigating through scenes of
arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints
and viewing directions are rendered and stored on an external volume. During navigation
each image can be displayed within a very short time by loading it from the volume.
For acceleration, our prefetching strategy loads possibly needed images for the
next few frames if the viewer takes a break. The measurements show that we achieve
interactive frame rates, whereby the difference between the minimal and maximal
display time is very small. Our system works well with scenes modelled by polygons,
but also digital photos can easily be used for describing a 3D scene.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Nicolas
full_name: Cuntz, Nicolas
last_name: Cuntz
citation:
ama: 'Klein J, Krokowski J, Cuntz N. Realtime Navigation in Highly Complex 3D-Scenes
Using JPEG Compression. In: Proc. of 4. GI-Informatiktage. ; 2002:224-229.'
apa: Klein, J., Krokowski, J., & Cuntz, N. (2002). Realtime Navigation in Highly
Complex 3D-Scenes Using JPEG Compression. In Proc. of 4. GI-Informatiktage
(pp. 224–229).
bibtex: '@inproceedings{Klein_Krokowski_Cuntz_2002, title={Realtime Navigation in
Highly Complex 3D-Scenes Using JPEG Compression}, booktitle={Proc. of 4. GI-Informatiktage},
author={Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}, year={2002}, pages={224–229}
}'
chicago: Klein, Jan, Jens Krokowski, and Nicolas Cuntz. “Realtime Navigation in
Highly Complex 3D-Scenes Using JPEG Compression.” In Proc. of 4. GI-Informatiktage,
224–29, 2002.
ieee: J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex
3D-Scenes Using JPEG Compression,” in Proc. of 4. GI-Informatiktage, 2002,
pp. 224–229.
mla: Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG
Compression.” Proc. of 4. GI-Informatiktage, 2002, pp. 224–29.
short: 'J. Klein, J. Krokowski, N. Cuntz, in: Proc. of 4. GI-Informatiktage, 2002,
pp. 224–229.'
date_created: 2020-10-05T09:51:08Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 224-229
publication: Proc. of 4. GI-Informatiktage
status: public
title: Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '24336'
abstract:
- lang: eng
text: "We define here a distributed abstract state machine (DASM) [7] of
\r\nthe network or routing layer of mobile ad hoc networks [13]. Such networks
re-\r\nquire routing strategies substantially different from those used in static
commu-\r\nnication networks, since storing and updating large routing tables
\ at mobile \r\nhosts would congest the network with administration packets
\ very fast. In [1], \r\nthe hypercubic location service is presented,
\ which considers a very strong \r\ndefinition of fault-tolerance thereby
\ improving state-of-the-art ad hoc routing \r\nprotocols in several respects.
Our goal in modeling the protocols for the distrib-\r\nuted location service and
the position based routing is twofold. First, we support \r\nthe definition and
\ validation of wireless communication protocols and imple-\r\nmentations
based thereon. Second, we feel that the abstract computation model \r\nnaturally
reflects the layering principle of communication architectures in com-\r\nbination
with an uncompromisingly local view of the application domain. Thus \r\nwe can
identify fundamental semantic concepts, such as concurrency, reactivity \r\nand
\ asynchronism, directly with the related concepts as imposed by the
\ given \r\napplication context. "
author:
- first_name: András
full_name: ' Benczúr, András'
last_name: ' Benczúr'
- first_name: Uwe
full_name: Glässer, Uwe
last_name: Glässer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Benczúr A, Glässer U, Lukovszki T. Formal Description of a Distributed Location
Service for Mobile Ad Hoc Networks. Proc of 10th International Workshop on
Abstract State Machines, LNCS. Published online 2002.
apa: Benczúr, A., Glässer, U., & Lukovszki, T. (2002). Formal Description of
a Distributed Location Service for Mobile Ad Hoc Networks. Proc. of 10th International
Workshop on Abstract State Machines, LNCS.
bibtex: '@article{ Benczúr_Glässer_Lukovszki_2002, title={Formal Description of
a Distributed Location Service for Mobile Ad Hoc Networks}, journal={Proc. of
10th International Workshop on Abstract State Machines, LNCS}, author={ Benczúr,
András and Glässer, Uwe and Lukovszki, Tamás}, year={2002} }'
chicago: Benczúr, András, Uwe Glässer, and Tamás Lukovszki. “Formal Description
of a Distributed Location Service for Mobile Ad Hoc Networks.” Proc. of 10th
International Workshop on Abstract State Machines, LNCS, 2002.
ieee: A. Benczúr, U. Glässer, and T. Lukovszki, “Formal Description of a Distributed
Location Service for Mobile Ad Hoc Networks,” Proc. of 10th International Workshop
on Abstract State Machines, LNCS, 2002.
mla: Benczúr, András, et al. “Formal Description of a Distributed Location Service
for Mobile Ad Hoc Networks.” Proc. of 10th International Workshop on Abstract
State Machines, LNCS, 2002.
short: A. Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop
on Abstract State Machines, LNCS (2002).
date_created: 2021-09-14T08:51:39Z
date_updated: 2022-01-06T06:56:18Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2021-09-14T09:09:28Z
date_updated: 2021-09-14T09:09:28Z
file_id: '24337'
file_name: asm03.pdf
file_size: 162215
relation: main_file
success: 1
file_date_updated: 2021-09-14T09:09:28Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proc. of 10th International Workshop on Abstract State Machines, LNCS
publication_status: published
status: public
title: Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks
type: journal_article
user_id: '15415'
year: '2002'
...
---
_id: '24338'
author:
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance
of Resource Efficient Wireless Network Topologies. In: Proceedings of the 8th
International Euro-Par Conference. ; 2002. doi:10.1007/3-540-45706-2_134'
apa: Grünewald, M., Lukovszki, T., Schindelhauer, C., & Volbert, K. (2002).
Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings
of the 8th International Euro-Par Conference. https://doi.org/10.1007/3-540-45706-2_134
bibtex: '@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn,
Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network
Topologies}, DOI={10.1007/3-540-45706-2_134},
booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald,
Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus},
year={2002} }'
chicago: Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus
Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”
In Proceedings of the 8th International Euro-Par Conference. Paderborn,
Germany, 2002. https://doi.org/10.1007/3-540-45706-2_134.
ieee: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed
Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: 10.1007/3-540-45706-2_134.'
mla: Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient
Wireless Network Topologies.” Proceedings of the 8th International Euro-Par
Conference, 2002, doi:10.1007/3-540-45706-2_134.
short: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings
of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.'
date_created: 2021-09-14T09:15:57Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_134
language:
- iso: eng
place: Paderborn, Germany
publication: Proceedings of the 8th International Euro-Par Conference
publication_identifier:
issn:
- 0302-9743
publication_status: published
status: public
title: Distributed Maintenance of Resource Efficient Wireless Network Topologies
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '26412'
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Volbert K. A simulation environment for ad hoc networks using sector subdivision.
In: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based
Processing. ; 2002. doi:10.1109/empdp.2002.994324'
apa: Volbert, K. (2002). A simulation environment for ad hoc networks using sector
subdivision. Proceedings 10th Euromicro Workshop on Parallel, Distributed and
Network-Based Processing. https://doi.org/10.1109/empdp.2002.994324
bibtex: '@inproceedings{Volbert_2002, title={A simulation environment for ad hoc
networks using sector subdivision}, DOI={10.1109/empdp.2002.994324},
booktitle={Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based
Processing}, author={Volbert, Klaus}, year={2002} }'
chicago: Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector
Subdivision.” In Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002. https://doi.org/10.1109/empdp.2002.994324.
ieee: 'K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,”
2002, doi: 10.1109/empdp.2002.994324.'
mla: Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector
Subdivision.” Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002, doi:10.1109/empdp.2002.994324.
short: 'K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002.'
date_created: 2021-10-18T15:45:20Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '63'
- _id: '26'
doi: 10.1109/empdp.2002.994324
language:
- iso: eng
publication: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based
Processing
publication_status: published
status: public
title: A simulation environment for ad hoc networks using sector subdivision
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '2136'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes
for non-uniform requirements. In: SPAA. ; 2002:53--62.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive
placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive
placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann,
André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62}
}'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive
Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement
schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
mla: Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform
Requirements.” SPAA, 2002, pp. 53--62.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.'
date_created: 2018-04-03T05:44:56Z
date_updated: 2022-01-06T06:54:56Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:02:22Z
date_updated: 2018-04-12T09:02:22Z
file_id: '2305'
file_name: BSS-SPAA-02.pdf
file_size: 123373
relation: main_file
file_date_updated: 2018-04-12T09:02:22Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 53--62
publication: SPAA
status: public
title: Compact, adaptive placement schemes for non-uniform requirements
type: conference
urn: '21366'
user_id: '14955'
year: '2002'
...