@inbook{2979, author = {{Blömer, Johannes and Günther, Peter and Liske, Gennadij}}, booktitle = {{Constructive Side-Channel Analysis and Secure Design}}, isbn = {{9783642400254}}, issn = {{0302-9743}}, pages = {{154--168}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Improved Side Channel Attacks on Pairing Based Cryptography}}}, doi = {{10.1007/978-3-642-40026-1_10}}, year = {{2013}}, } @inbook{6276, author = {{Klompmaker, Florian and Paelke, Volker and Fischer, Holger Gerhard}}, booktitle = {{Distributed, Ambient, and Pervasive Interactions}}, isbn = {{9783642393501}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{32--41}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{A Taxonomy-Based Approach towards NUI Interaction Design}}}, doi = {{10.1007/978-3-642-39351-8_4}}, volume = {{8028}}, year = {{2013}}, } @inbook{6279, author = {{Fischer, Holger Gerhard and Strenge, Benjamin and Nebe, Karsten}}, booktitle = {{Design, User Experience, and Usability. Design Philosophy, Methods, and Tools}}, isbn = {{9783642392283}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{252--261}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design}}}, doi = {{10.1007/978-3-642-39229-0_28}}, volume = {{8012}}, year = {{2013}}, } @inproceedings{6732, author = {{Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}}, booktitle = {{Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}}, isbn = {{9783642403125}}, issn = {{0302-9743}}, pages = {{729--740}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Separating Regular Languages by Piecewise Testable and Unambiguous Languages}}}, doi = {{10.1007/978-3-642-40313-2_64}}, year = {{2013}}, } @inproceedings{15093, author = {{Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas}}, booktitle = {{Big Data - 29th British National Conference on Databases, BNCOD 2013,}}, isbn = {{9783642394669}}, issn = {{0302-9743}}, pages = {{149--164}}, publisher = {{Springer}}, title = {{{Fast Multi-update Operations on Compressed XML Data}}}, doi = {{10.1007/978-3-642-39467-6_15}}, year = {{2013}}, } @inbook{16406, abstract = {{In order to evaluate the efficiency of algorithms for real-time 3D rendering, different properties like rendering time, occluded triangles, or image quality, need to be investigated. Since these properties depend on the position of the camera, usually some camera path is chosen, along which the measurements are performed. As those measurements cover only a small part of the scene, this approach hardly allows drawing conclusions regarding the algorithm's properties at arbitrary positions in the scene. The presented method allows the systematic and position-independent evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate the distribution of a property (like rendering time) for all positions in the scene. This approximation can be visualized to produce an intuitive impression of the algorithm's behavior or be statistically analyzed for objectively rating and comparing algorithms. We demonstrate our method by evaluating performance aspects of a known occlusion culling algorithm. }}, author = {{Jähn, Claudius and Eikel, Benjamin and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642419133}}, issn = {{0302-9743}}, title = {{{Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties}}}, doi = {{10.1007/978-3-642-41914-0_12}}, year = {{2013}}, } @inbook{16407, abstract = {{Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant. }}, author = {{Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642419133}}, issn = {{0302-9743}}, title = {{{Real-Time 3D Rendering of Heterogeneous Scenes}}}, doi = {{10.1007/978-3-642-41914-0_44}}, year = {{2013}}, } @inproceedings{20179, author = {{Hamann, Heiko and Engelbrecht, Andreas and Birattari, Mauro and Dorigo, Marco and Blum, Christian and Stuetzle, Thomas and Christensen, Anders Lyhne and Gross, Roderich}}, booktitle = {{Swarm Intelligence: 8th International Conference, ANTS 2012}}, isbn = {{9783642326493}}, issn = {{0302-9743}}, pages = {{168--179}}, publisher = {{Springer}}, title = {{{Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions}}}, doi = {{10.1007/978-3-642-32650-9_15}}, volume = {{7461}}, year = {{2012}}, } @inbook{2918, author = {{Kakvi, Saqib and Kiltz, Eike and May, Alexander}}, booktitle = {{Advances in Cryptology – ASIACRYPT 2012}}, isbn = {{9783642349607}}, issn = {{0302-9743}}, pages = {{404--414}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Certifying RSA}}}, doi = {{10.1007/978-3-642-34961-4_25}}, year = {{2012}}, } @inbook{2919, author = {{Kakvi, Saqib and Kiltz, Eike}}, booktitle = {{Advances in Cryptology – EUROCRYPT 2012}}, isbn = {{9783642290107}}, issn = {{0302-9743}}, pages = {{537--553}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Optimal Security Proofs for Full Domain Hash, Revisited}}}, doi = {{10.1007/978-3-642-29011-4_32}}, year = {{2012}}, } @inbook{16445, author = {{Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Experimental Algorithms}}, isbn = {{9783642308499}}, issn = {{0302-9743}}, title = {{{Continuous Local Strategies for Robotic Formation Problems}}}, doi = {{10.1007/978-3-642-30850-5_2}}, year = {{2012}}, } @inbook{16448, author = {{Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{Algorithms for Sensor Systems}}, isbn = {{9783642282089}}, issn = {{0302-9743}}, title = {{{Local, Self-organizing Strategies for Robotic Formation Problems}}}, doi = {{10.1007/978-3-642-28209-6_2}}, year = {{2012}}, } @inbook{16516, author = {{Baier, Robert and Molo, Mirko Hessel-von}}, booktitle = {{Large-Scale Scientific Computing}}, isbn = {{9783642298424}}, issn = {{0302-9743}}, title = {{{Newton’s Method and Secant Method for Set-Valued Mappings}}}, doi = {{10.1007/978-3-642-29843-1_9}}, year = {{2012}}, } @inbook{15891, author = {{Jager, Tibor and Schinzel, Sebastian and Somorovsky, Juraj}}, booktitle = {{Computer Security – ESORICS 2012}}, isbn = {{9783642331664}}, issn = {{0302-9743}}, title = {{{Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}}}, doi = {{10.1007/978-3-642-33167-1_43}}, year = {{2012}}, } @inproceedings{16408, abstract = {{We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time. }}, author = {{Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642331787}}, issn = {{0302-9743}}, pages = {{502--512}}, title = {{{Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}}}, doi = {{10.1007/978-3-642-33179-4_48}}, volume = {{7431}}, year = {{2012}}, } @inproceedings{20183, author = {{Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}}, booktitle = {{10th European Conference on Artificial Life (ECAL'09)}}, isbn = {{9783642212826}}, issn = {{0302-9743}}, pages = {{442----449}}, title = {{{Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System}}}, doi = {{10.1007/978-3-642-21283-3_55}}, volume = {{5777}}, year = {{2011}}, } @article{3332, author = {{Lettmann, Theodor and Baumann, Michael and Eberling, Markus and Kemmerich, Thomas}}, isbn = {{9783642240157}}, issn = {{0302-9743}}, journal = {{Transactions on Computational Collective Intelligence V}}, pages = {{157--181}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Modeling Agents and Agent Systems}}}, doi = {{10.1007/978-3-642-24016-4_9}}, year = {{2011}}, } @inbook{20709, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{SOFSEM 2011: Theory and Practice of Computer Science}}, isbn = {{9783642183805}}, issn = {{0302-9743}}, title = {{{Collisionless Gathering of Robots with an Extent}}}, doi = {{10.1007/978-3-642-18381-2_15}}, year = {{2011}}, } @inbook{20710, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783642220111}}, issn = {{0302-9743}}, title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}}, doi = {{10.1007/978-3-642-22012-8_52}}, year = {{2011}}, } @inbook{6293, author = {{Nebe, Karsten and Klompmaker, Florian and Jung, Helge and Fischer, Holger Gerhard}}, booktitle = {{Human-Computer Interaction. Interaction Techniques and Environments.}}, editor = {{Jacko, Julie Anne}}, isbn = {{9783642216046}}, issn = {{0302-9743}}, location = {{Orlando, USA}}, pages = {{100--109}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction}}}, doi = {{10.1007/978-3-642-21605-3_11}}, volume = {{6762}}, year = {{2011}}, }