@article{24282, author = {{Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}}, issn = {{0302-9743}}, journal = {{ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications}}, title = {{{Robust Undetectable Interference Watermarks}}}, doi = {{10.1007/11424826_55}}, year = {{2010}}, } @inbook{2988, author = {{Ackermann, Marcel R. and Blömer, Johannes}}, booktitle = {{SWAT 2010}}, isbn = {{9783642137303}}, issn = {{0302-9743}}, pages = {{212--223}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Bregman Clustering for Separable Instances}}}, doi = {{10.1007/978-3-642-13731-0_21}}, year = {{2010}}, } @inbook{20961, abstract = {{Self-healing promises to improve the dependability of systems. In particular safety-critical systems like automotive systems are well suited application, since safe operation is required in these systems even in case of failures. Prerequisite for the improved dependability is the correct realization of the self-healing techniques. Consequently, self-healing activities should be rigorously specified and appropriately integrated with the rest of the system. In this paper, we present an approach for designing self-healing mechanisms in automotive systems. The approach contains a construction model which consist of a structural description as well as an extensive set of constraints. The constraints specify a correct system structure and are also used in the self-healing activities. We exemplify the self-healing approach using the adaptive cruise control system of modern cars. }}, author = {{Seebach, Hella and Nafz, Florian and Holtmann, Jörg and Meyer, Jan and Tichy, Matthias and Reif, Wolfgang and Schäfer, Wilhelm}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783642165757}}, issn = {{0302-9743}}, title = {{{Designing Self-healing in Automotive Systems}}}, doi = {{10.1007/978-3-642-16576-4_4}}, year = {{2010}}, } @inproceedings{19029, author = {{Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}}, booktitle = {{Workshop on Internet and Network Economics (WINE)}}, isbn = {{9783642175718}}, issn = {{0302-9743}}, title = {{{Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}}}, doi = {{10.1007/978-3-642-17572-5_37}}, year = {{2010}}, } @inbook{16505, abstract = {{We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.}}, author = {{Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642172885}}, issn = {{0302-9743}}, title = {{{Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}}}, doi = {{10.1007/978-3-642-17289-2_60}}, year = {{2010}}, } @inproceedings{15137, author = {{Böttcher, Stefan and Hartel, Rita and Messinger, Christian}}, booktitle = {{Database and XML Technologies - 7th International XML Database Symposium, XSym 2010}}, isbn = {{9783642156830}}, issn = {{0302-9743}}, pages = {{103--112}}, publisher = {{Springer}}, title = {{{Searchable Compression of Office Documents by XML Schema Subtraction}}}, doi = {{10.1007/978-3-642-15684-7_9}}, year = {{2010}}, } @inbook{16365, author = {{Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}}, booktitle = {{Structural Information and Communication Complexity}}, isbn = {{9783642132834}}, issn = {{0302-9743}}, pages = {{168--182}}, title = {{{A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}}}, doi = {{10.1007/978-3-642-13284-1_14}}, year = {{2010}}, } @book{16403, editor = {{Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.}}, isbn = {{9783642141614}}, issn = {{0302-9743}}, title = {{{Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}}}, doi = {{10.1007/978-3-642-14162-1}}, year = {{2010}}, } @book{16404, editor = {{Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.}}, isbn = {{9783642141614}}, issn = {{0302-9743}}, title = {{{Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}}}, doi = {{10.1007/978-3-642-14165-2}}, year = {{2010}}, } @inbook{13301, author = {{Trier, Matthias and Müller, Claudia}}, booktitle = {{Practical Aspects of Knowledge Management}}, isbn = {{9783540240884}}, issn = {{0302-9743}}, title = {{{Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes}}}, doi = {{10.1007/978-3-540-30545-3_23}}, year = {{2010}}, } @inbook{19724, abstract = {{We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.}}, author = {{Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}}, booktitle = {{Algorithmic Aspects of Wireless Sensor Networks}}, isbn = {{9783642054334}}, issn = {{0302-9743}}, pages = {{252--262}}, publisher = {{Springer}}, title = {{{Complexity and Approximation of a Geometric Local Robot Assignment Problem}}}, doi = {{10.1007/978-3-642-05434-1_25}}, year = {{2009}}, } @inbook{2920, author = {{Kakvi, Saqib}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783642040511}}, issn = {{0302-9743}}, pages = {{300--301}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Reinforcement Learning for Blackjack}}}, doi = {{10.1007/978-3-642-04052-8_43}}, year = {{2009}}, } @inbook{3000, author = {{Schrieb, Jonas and Wehrheim, Heike and Wonisch, Daniel}}, booktitle = {{FM 2009: Formal Methods}}, isbn = {{9783642050886}}, issn = {{0302-9743}}, pages = {{106--122}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Three-Valued Spotlight Abstractions}}}, doi = {{10.1007/978-3-642-05089-3_8}}, year = {{2009}}, } @inbook{23744, abstract = {{In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability. We consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard. Considering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3.}}, author = {{Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}}, booktitle = {{Lecture Notes in Computer Science}}, issn = {{0302-9743}}, title = {{{On Stackelberg Pricing with Computationally Bounded Consumers}}}, doi = {{10.1007/978-3-642-10841-9_6}}, year = {{2009}}, } @inbook{1830, author = {{Biermann, Thorsten and Schwabe, Arne and Karl, Holger}}, booktitle = {{NETWORKING 2009}}, isbn = {{9783642013980}}, issn = {{0302-9743}}, pages = {{883--894}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}}}, doi = {{10.1007/978-3-642-01399-7_69}}, year = {{2009}}, } @inbook{9616, author = {{Kakvi, Saqib}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783642040511}}, issn = {{0302-9743}}, title = {{{Reinforcement Learning for Blackjack}}}, doi = {{10.1007/978-3-642-04052-8_43}}, year = {{2009}}, } @proceedings{61021, editor = {{Mertsching, Bärbel and Hund, Marcus and Aziz, Zaheer}}, isbn = {{9783642046162}}, issn = {{0302-9743}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{KI 2009: Advances in Artificial Intelligence}}}, doi = {{10.1007/978-3-642-04617-9}}, year = {{2009}}, } @inproceedings{66535, author = {{Hund, Marcus and Mertsching, Bärbel}}, booktitle = {{KI 2009: Advances in Artificial Intelligence}}, isbn = {{9783642046162}}, issn = {{0302-9743}}, location = {{Paderborn}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Occlusion as a Monocular Depth Cue Derived from Illusory Contour Perception}}}, doi = {{10.1007/978-3-642-04617-9_13}}, year = {{2009}}, } @inproceedings{19686, author = {{Briest, Patrick}}, booktitle = {{Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}}, isbn = {{9783540705741}}, issn = {{0302-9743}}, title = {{{Uniform Budgets and the Envy-Free Pricing Problem}}}, doi = {{10.1007/978-3-540-70575-8_66}}, year = {{2008}}, } @inproceedings{19003, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}}, isbn = {{9783540699002}}, issn = {{0302-9743}}, pages = {{378--389}}, title = {{{The Kinetic Facility Location Problem}}}, doi = {{10.1007/978-3-540-69903-3_34}}, year = {{2008}}, }