@inproceedings{2124,
author = {{Awerbuch, Baruch and Scheideler, Christian}},
booktitle = {{SODA}},
pages = {{318----327}},
title = {{{The hyperring: a low-congestion deterministic data structure for distributed environments}}},
year = {{2004}},
}
@inproceedings{2125,
author = {{Awerbuch, Baruch and Scheideler, Christian}},
booktitle = {{SPAA}},
pages = {{44----53}},
title = {{{Consistent and compact data management in distributed storage systems}}},
year = {{2004}},
}
@inproceedings{2126,
author = {{Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}},
booktitle = {{SPAA}},
pages = {{170----179}},
title = {{{Pagoda: a dynamic overlay network for routing, data management, and multicasting}}},
year = {{2004}},
}
@inproceedings{2127,
author = {{Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}},
booktitle = {{SPAA}},
pages = {{286----293}},
publisher = {{ACM}},
title = {{{The effect of faults on network expansion}}},
year = {{2004}},
}
@inproceedings{17346,
author = {{Brinkmann, André and Heidebuer, Michael and Meyer auf der Heide, Friedhelm and Rückert, Ulrich and Salzwedel, Kay and Vodisek, Mario}},
booktitle = {{21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA}},
editor = {{Kobler, Ben and Hariharan, P. C.}},
pages = {{153----157}},
publisher = {{IEEE}},
title = {{{V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System}}},
year = {{2004}},
}
@inproceedings{18777,
author = {{Sohler, Christian and Damerow, Valentina}},
booktitle = {{Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04)}},
pages = {{93 -- 96}},
title = {{{Smoothed Number of Extreme Points under Uniform Noise}}},
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}},
}
@inproceedings{18786,
author = {{Sohler, Christian and Czumaj, Artur}},
booktitle = {{Automata, Languages and Programming (ICALP)}},
number = {{1}},
pages = {{396--407}},
title = {{{Sublinear-Time Approximation for Clustering via Random Sampling}}},
year = {{2004}},
}
@inproceedings{1911,
author = {{Aguiar, Ana and Karl, Holger and Wolisz, Adam}},
booktitle = {{Proceedings of European Wireless 2004, Barcelona / Spain }},
title = {{{Channel Adaptive Techniques in the Presence of Channel Prediction Inaccuracy}}},
year = {{2004}},
}
@inproceedings{20931,
abstract = {{Object-oriented software development is a subject area difficult to teach, espcially to beginners. They face a lot of abstraction and (from a beginners point of view) isolated topics, such as the syntax and semantics of a programming language, the functionality of a software development environment and basic object-oriented concepts. Although many professionals in education believe in the ``object first'' approach as the best method of introducing object-oriented concepts, there is no common agreement on how to start such courses. Current study programs often begin by teaching a programming language, instead of focusing on the basics of object-oriented concepts. In the last years a learning environment was developed based on a visual programming language to abstract away from details. It assists teaching step-by-step object-oriented concepts and the syntax and semantics of a programming language in secondary schools and first year university courses. Our goal is to port this learning environment to the widely used IDE Eclipse.}},
author = {{Meyer, Matthias and Wendehals, Lothar}},
booktitle = {{Proc. of the Eclipse Technology eXchange Workshop (ETX), Satellite Event of the 19th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Vancouver, Canada}},
pages = {{1--5}},
publisher = {{ACM Press}},
title = {{{Teaching Object-Oriented Concepts with Eclipse}}},
year = {{2004}},
}
@inproceedings{20932,
abstract = {{Design recovery, which means extracting design documents from source code, is usually done by static analysis techniques. Analysing behaviour by static analysis is very imprecise. We combine static and dynamic analysis to increase the preciseness of our design recovery process. In this paper we present an approach to collect data for the dynamic analysis by recording method calls during a program's execution. To reduce the amount of information we monitor only relevant classes and methods identified by static analysis.}},
author = {{Wendehals, Lothar and Meyer, Matthias and Elsner, Andreas}},
booktitle = {{Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany}},
pages = {{7--10}},
publisher = {{University of Paderborn}},
title = {{{Selective Tracing of Java Programs}}},
volume = {{tr-ri-04-253}},
year = {{2004}},
}
@article{17986,
author = {{Ziegler, Martin and Brattka, Vasco}},
journal = {{Theoretical Computer Science}},
number = {{1-3}},
pages = {{187--211}},
title = {{{Computability in linear algebra}}},
doi = {{https://doi.org/10.1016/j.tcs.2004.06.022}},
volume = {{326}},
year = {{2004}},
}
@inproceedings{18260,
abstract = {{For uniform computability of regular sets in Euclidean space, previous work has identified twelve 'basic' notions, to (pairs of) which many previous notions considered in literature were shown to be equivalent.
With respect to those basic notions, we now investigate on the computability of natural OPERATIONS on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions.}},
author = {{Ziegler, Martin}},
booktitle = {{Computability and Complexity in Analysis}},
issn = {{0942-5616}},
number = {{4-5}},
pages = {{392--404}},
title = {{{Computable operators on regular sets}}},
doi = {{10.1002/malq.200310107}},
volume = {{50}},
year = {{2004}},
}
@inproceedings{18263,
abstract = {{We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients, simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations. In terms of the input size N being quadratic in n, this amounts to an amortized cost of O(N^0.334) per point.}},
author = {{Nüsken, Michael and Ziegler, Martin}},
booktitle = {{Proc. 12th Annual Symposium on Algorithms (ESA'04)}},
isbn = {{9783540230250}},
issn = {{0302-9743}},
pages = {{544--555}},
publisher = {{Springer}},
title = {{{Fast Multipoint Evaluation of Bivariate Polynomials}}},
doi = {{10.1007/978-3-540-30140-0_49}},
volume = {{3221}},
year = {{2004}},
}
@inproceedings{18279,
abstract = {{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 = {{Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}},
booktitle = {{Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04)}},
isbn = {{9783540241317}},
issn = {{0302-9743}},
pages = {{805--821}},
publisher = {{Springer }},
title = {{{Spanners, Weak Spanners, and Power Spanners for Wireless Networks}}},
doi = {{10.1007/978-3-540-30551-4_69}},
volume = {{3341}},
year = {{2004}},
}
@inproceedings{18364,
abstract = {{The visualisation of manufacturing-processes assists the user in understanding and analysis.
Typically he can move free and unguided in a virtual environment which visualizes the entire
process. Thus knowledge and conclusions are to some extend acquired on a random base.
This article describes the development of a tool, which enables the user to interactively improve
significant production processes in the simulation. He moves in a virtual 3D-environment
(walkthrough system) and is able to acquire automatically calculated indications for significant
processes. At the same time the simulation considers significant objects in a more detailed way. If
the viewer is interested in a significant process, he is automatically guided to the relevant location
where he can examine the critical situation by modification of the simulation model.}},
author = {{Mueck, Bengt and Dangelmaier, Wilhelm and Laroque, Christoph and Fischer, Matthias and Kortenjan, Michael}},
booktitle = {{Simulation and Visualisation 2004}},
pages = {{73--83}},
publisher = {{SCS European Publishing House}},
title = {{{Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations}}},
year = {{2004}},
}
@article{18447,
author = {{Oesterdiekhoff, Brigitte}},
journal = {{Informatik Spektrum}},
number = {{5}},
pages = {{448--452}},
title = {{{Transcoding von Webinhalten}}},
volume = {{27}},
year = {{2004}},
}
@inproceedings{18448,
author = {{Oesterdiekhoff, Brigitte}},
booktitle = {{Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES'04)}},
title = {{{Internet Premium Services for Flexible Format Distributed Devices}}},
year = {{2004}},
}
@inproceedings{21780,
author = {{Goetz, F. and Boenning, B. and Domik, Gitta}},
booktitle = {{Proc. of The 4th IASTED International Conference on Visualization, Imgaging, and Image Processing}},
title = {{{Mapping High Quality Textures on an Interactive Globe}}},
year = {{2004}},
}