@misc{17681,
author = {Peckhaus, Volker},
booktitle = {Lexikon der bedeutenden Naturwissenschaftler in drei Bänden, Bd. 3: Men–Z},
editor = {Hoffmann, Dieter and Laitko, Hubert and Müller-Wille, Staffan},
pages = {348},
publisher = {Spektrum Akademischer Verlag},
title = {{Tarski, Alfred}},
year = {2004},
}
@inbook{18278,
author = {Tophinke, Doris},
booktitle = {Fliegende Bilder, fliehende Texte},
editor = {Berg u. a., Walter Bruno},
pages = {97--114},
publisher = {Vervuert},
title = {{Texttypen und Diskurse in Zusammenhängen sprachlicher Identitätskonstruktion. Überlegungen im Anschluss an Foucault}},
year = {2004},
}
@misc{18482,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1026.01016]},
title = {{Ropolyi, László, “Lakatos and Lukács”, in: G. Kampis/L. Kvasz/M. Stöltzner (Hgg.), Appraising Lakatos: Mathematics, Methodology and the Man, Kluwer: Dordrecht 2002, 303–337}},
year = {2004},
}
@misc{18487,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1030.01021]},
title = {{Sundholm, Göran, “Frege, August Bebel and the Return of Alsace-Lorraine: The Dating of the Distinction between Sinn and Bedeutung”, History and Philosophy of Logic 22 (2001), 57–73}},
year = {2004},
}
@misc{18499,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1042.00004]},
title = {{Klein, Carsten, “Conventionalism and Realism in Hans Reichenbach’s Philosophy of Geometry”, International Studies in the Philosophy of Science 15 (2001), 243–251}},
year = {2004},
}
@misc{18494,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1033.00007]},
title = {{Martinich, A.P./Sosa, David (Hgg.), Analytic Philosophy. An Anthology, Blackwell Pubishers: Malden MA 2001 (Blackwell Philosophy Anthologies; 13)}},
year = {2004},
}
@misc{18502,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1047.03008]},
title = {{Zalta, Edward N., “Fregean Senses, Modes of Presentation, and Concepts”, in: James E. Tomberlin (Hg.), Metaphysics, 2001, Blackwell: Boston 2001 (Philosophical Perspectives; 15), 335–359}},
year = {2004},
}
@inproceedings{16474,
abstract = {Given n distinct points p1, p2, ... , pn in the plane, the map labeling
problem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn
of maximum possible size such that pi is a corner of Qi and no two squares overlap.
This problem is NP-hard and no algorithm with approximation ratio better
than 1/2 exists unless P = NP [10].
In this paper, we consider a scenario where we want to visualize the information
gathered by smart dust, i.e. by a large set of simple devices, each consisting of
a sensor and a sender that can gather sensor data and send it to a central station.
Our task is to label (the positions of) these sensors in a way described by the
labeling problem above. Since these devices are not positioned accurately (for
example, they might be dropped from an airplane), this gives rise to consider the
map labeling problem under the assumption, that the positions of the points are
not fixed precisely, but perturbed by random noise. In other words, we consider
the smoothed complexity of the map labeling problem. We present an algorithm
that, under such an assumption and Gaussian random noise with sufficiently large
variance, has linear smoothed complexity.},
author = {Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian},
booktitle = {12th Annual European Symposium on Algorithms (ESA 2004)},
isbn = {9783540230250},
issn = {0302-9743},
title = {{Labeling Smart Dust}},
doi = {10.1007/978-3-540-30140-0_9},
volume = {3221},
year = {2004},
}
@inproceedings{18778,
abstract = {Given a point set P in the d-dimensional unit hypercube, we give upper bounds on the maximal expected number of extreme points when each point is perturbed by small random noise chosen independently for each point from the same noise distribution Δ. Our results are parametrized by the variance of the noise distribution. For large variance we essentially consider the average case for distribution Δ while for variance 0 we consider the worst case. Hence our results give upper bounds on the number of extreme points where our input distributions range from average case to worst case.

Our main contribution is a rather general lemma that can be used to obtain upper bounds on the expected number of extreme points for a large class of noise distributions. We then apply this lemma to obtain explicit bounds for random noise coming from the Gaussian normal distribution of variance σ² and the uniform distribution in a hypercube of side length &epsilon. For these noise distributions we show upper bounds of O( (1/ σ )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / ε )^d/(d+1) ), respectively. Besides its theoretical motivation our model is also motivated by the observation that in many applications of convex hull algorithms the input data is inherently noisy, e.g. when the data comes from physical measurement or imprecise arithmetic is used.},
author = {Damerow, Valentina and Sohler, Christian},
booktitle = {Proceedings of the 12th European Symposium on Algorithms (ESA'04)},
isbn = {9783540230250},
issn = {0302-9743},
title = {{Extreme Points Under Random Noise}},
doi = {10.1007/978-3-540-30140-0_25},
year = {2004},
}
@inproceedings{18785,
abstract = {A limiting factor in the performance of a render- ing system is the number of state changes, i.e., changes of the attributes material, texture, shader program, etc., in the stream of rendered primitives. We propose to include a small buffer between appli- cation and graphics hardware in the rendering sys- tem. This pipeline buffer is used to rearrange the incoming sequence of primitives on-line and locally in such a way that the number of state changes is minimized. This method is generic; it can be easily integrated into existing rendering systems. In our experiments a pipeline buffer reduces the number of state changes by an order of magnitude and achieves almost the same rendering time as an optimal, i.e., presorted, sequence without pipeline buffer. Due to its simple structure and its low mem- ory requirements this method can easily be imple- mented in software or even hardware.},
author = {Sohler, Christian and Krokowski, Jens and Räcke, Harald and Westermann, Matthias},
booktitle = {Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004)},
title = {{Reducing State Changes with a Pipeline Buffer}},
year = {2004},
}