---
_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'
...