E-LIB Suche - Ergebnisse für: Icking, Christian

1

Algorithmic Approaches Towards Pedestrian Safety in Sensor-..:

Terhar, Fynn , 2023

Link: https://nbn-resolving.de..

2

An Open-Source High-Level Fusion Algorithm in ROS for Autom..:

, In: 2022 10th International Conference in Software Engineering Research and Innovation (CONISOFT),

Poledna, Yuri ; Reway, Fabio ; Drechsler, Maikol Funk... - p. 174-181 , 2022

Link: https://doi.org/10.1109/..

3

Simulation-based test methods with an automotive camera-in-..:

, In: 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME),

Reway, Fabio ; Drechsler, Maikol ; Murthy, Ravikiran... - p. 1-8 , 2022

Link: https://doi.org/10.1109/..

4

The Sectional Art Gallery and an Evolutionary Algorithm for..:

, In: 2021 IEEE Congress on Evolutionary Computation (CEC),

Terhar, Fynn ; Icking, Christian - p. 1390-1397 , 2021

Link: https://doi.org/10.1109/..

5

A telemetry design for anticipating train-road crossing col..:

, In: 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM),

Mader, Markus ; Munst, Wolfgang ; Dannheim, Clemens... - p. 351-356 , 2015

Link: https://doi.org/10.1109/..

6

Prescont: Predicting protein‐protein interfaces utilizing f..:

Zellner, Hermann ; Staudigel, Martin ; Trenner, Thomas...
Proteins: Structure, Function, and Bioinformatics. 80 (2011) 1 - p. 154-168 , 2011

Link: https://doi.org/10.1002/..

7

An Optimal Competitive Strategy for Walking in Streets:

Icking, Christian ; Klein, Rolf ; Langetepe, Elmar..
SIAM Journal on Computing. 33 (2004) 2 - p. 462-486 , 2004

Link: https://doi.org/10.1137/..

8

A tight bound for the complexity of voroni diagrams under p..:

, In: Proceedings of the thirty-third annual ACM symposium on Theory of computing,

Icking, Christian ; Ha, Lihong - p. 316-321 , 2001

Link: https://dl.acm.org/doi/1..

9

The Polygon Exploration Problem:

Hoffmann, Frank ; Icking, Christian ; Klein, Rolf.
SIAM Journal on Computing. 31 (2001) 2 - p. 577-600 , 2001

Link: https://doi.org/10.1137/..

10

On bisectors for different distance functions:

Icking, Christian ; Klein, Rolf ; Ma, Lihong..
Discrete Applied Mathematics. 109 (2001) 1-2 - p. 139-161 , 2001

Link: https://doi.org/10.1016/..

11

Generalized self-approaching curves:

Aichholzer, Oswin ; Aurenhammer, Franz ; Icking, Christian...
Discrete Applied Mathematics. 109 (2001) 1-2 - p. 3-24 , 2001

Link: https://doi.org/10.1016/..

12

Competitive searching in a generalized street:

Datta, Amitava ; Icking, Christian
Computational Geometry. 13 (1999) 2 - p. 109-120 , 1999

Link: https://doi.org/10.1016/..

13

How to find a point on a line within a fixed distance:

Hipke, Christoph ; Icking, Christian ; Klein, Rolf.
Discrete Applied Mathematics. 93 (1999) 1 - p. 67-73 , 1999

Link: https://doi.org/10.1016/..

14

On bisectors for different distance functions:

, In: Proceedings of the fifteenth annual symposium on Computational geometry,

Icking, Christian ; Klein, Rolf ; Ma, Lihong.. - p. 291-299 , 1999

Link: https://dl.acm.org/doi/1..

15

A competitive strategy for learning a polygon:

, In: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms,

Hoffmann, Frank ; Icking, Christian ; Klein, Rolf. - p. 166-174 , 1997

Link: https://dl.acm.org/doi/1..