@inbook{18259,
author = {Tophinke, Doris},
booktitle = {Grundlagen der Deutschdidaktik},
editor = {Lange, Günter and Weinhold, Swantje},
pages = {101--127},
publisher = {Schneider Hohengehren},
title = {{Rechtschreiben}},
year = {2005},
}
@inproceedings{18449,
author = {Loeser, Christoph and Drüke, Isabell and Oesterdiekhoff, Brigitte},
booktitle = {IEEE International Conference on Industrial Informatics (INDIN)},
title = {{ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario}},
year = {2005},
}
@misc{18519,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1072.01018]},
title = {{Ziche, Paul, „Mathematik als Wissenschaftlichkeitsmodell. Wissenschaftssystematische Konsequenzen variierender Deutungen der Mathematik (1800/1900)“, in: Rudolf Seising/Menso Folkerts/Ulf Hashagen (Hgg.), Form, Zahl, Ordnung. Studien zur Wissenschafts- und Technikgeschichte. Festschrift für Ivo Schneider zum 65. Geburtstag, Franz Steiner Verlag: Stuttgart 2004, 91–106}},
year = {2005},
}
@misc{18507,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1055.03005; Wiederabdruck aus MR 2005b:03010; online: MathSciNet 2020423]},
title = {{van Atten, Mark/Kennedy, Juliette, “On the Philosophical Development of Kurt Gödel”, Bulletin of Symbolic Logic 9 (2003), 425–476}},
year = {2005},
}
@misc{18514,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1059.00006]},
title = {{Neuser, Wolfgang/Hösle, Vittorio (Hgg.), Logik, Mathematik und Natur im objektiven Idealismus. Festschrift für Dieter Wandschneider zum 65. Geburtstag, Könighausen & Neumann: Würzburg 2004}},
year = {2005},
}
@misc{18805,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2005b:00008; MathSciNet 2025850]},
title = {{Reck, Erich H., “Dedekind’s Structuralism: an Interpretation and Partial Defense”, Synthese 137 (2003), 369–419}},
year = {2005},
}
@misc{18812,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2005k:03004; MathSciNet 2116140]},
title = {{Kang, Jinho, “On the Composition of the Prototractatus”, Philosophical Quarterly 55 (2005), 1–20}},
year = {2005},
}
@article{18855,
abstract = {We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\mathbb R^d$. We focus on the setting where 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 + \eps$ using only $\widetilde{\O}(\sqrt{n} \, \text{poly} (1/\eps))$ 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 neighbor queries.
Read More: https://epubs.siam.org/doi/10.1137/S0097539703435297
},
author = {Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian},
issn = {0097-5397},
journal = {SIAM Journal on Computing},
number = {1},
pages = {91--109},
title = {{Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}},
doi = {10.1137/s0097539703435297},
volume = {35},
year = {2005},
}
@inproceedings{18867,
abstract = {Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.

We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.},
author = {Frahling, Gereon and Krokowski, Jens},
booktitle = {Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)},
isbn = {9783540291183},
issn = {0302-9743},
pages = {758--769},
publisher = {Springer},
title = {{Online Occlusion Culling}},
doi = {10.1007/11561071_67},
volume = {3669},
year = {2005},
}
@inproceedings{18925,
abstract = {The dynamic page migration problem citedynamic-page-migration is defined in

a distributed network of $n$ mobile nodes sharing one indivisible memory page

of size $D$. During runtime, the nodes can both access a unit of data from

the page and move with a constant speed, thus changing the costs of communication.

The problem is to compute * online* a schedule of page movements

to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.

We prove that it achieves an (up to a constant factor) optimal competitive ratio

$O(n cdot sqrtD)$. We show that the randomization of this algorithm

improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).

This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.

We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem.},
author = {Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw},
booktitle = {Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)},
isbn = {9783540249986},
issn = {0302-9743},
pages = {365--376},
title = {{Improved Algorithms for Dynamic Page Migration}},
doi = {10.1007/978-3-540-31856-9_30},
year = {2005},
}