11 Search Results for "H�ppner, Frank"


Document
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings

Authors: Frank Kammer and Johannes Meintrup

Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)


Abstract
We present a novel space-efficient graph coarsening technique for n-vertex planar graphs G, called cloud partition, which partitions the vertices V(G) into disjoint sets C of size O(log n) such that each C induces a connected subgraph of G. Using this partition 𝒫 we construct a so-called structure-maintaining minor F of G via specific contractions within the disjoint sets such that F has O(n/log n) vertices. The combination of (F, 𝒫) is referred to as a cloud decomposition. For planar graphs we show that a cloud decomposition can be constructed in O(n) time and using O(n) bits. Given a cloud decomposition (F, 𝒫) constructed for a planar graph G we are able to find a balanced separator of G in O(n/log n) time. Contrary to related publications, we do not make use of an embedding of the planar input graph. We generalize our cloud decomposition from planar graphs to H-minor-free graphs for any fixed graph H. This allows us to construct the succinct encoding scheme for H-minor-free graphs due to Blelloch and Farzan (CPM 2010) in O(n) time and O(n) bits improving both runtime and space by a factor of Θ(log n). As an additional application of our cloud decomposition we show that, for H-minor-free graphs, a tree decomposition of width O(n^{1/2 + ε}) for any ε > 0 can be constructed in O(n) bits and a time linear in the size of the tree decomposition. A similar result by Izumi and Otachi (ICALP 2020) constructs a tree decomposition of width O(k √n log n) for graphs of treewidth k ≤ √n in sublinear space and polynomial time.

Cite as

Frank Kammer and Johannes Meintrup. Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 62:1-62:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{kammer_et_al:LIPIcs.ISAAC.2022.62,
  author =	{Kammer, Frank and Meintrup, Johannes},
  title =	{{Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings}},
  booktitle =	{33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
  pages =	{62:1--62:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-258-7},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{248},
  editor =	{Bae, Sang Won and Park, Heejin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.62},
  URN =		{urn:nbn:de:0030-drops-173478},
  doi =		{10.4230/LIPIcs.ISAAC.2022.62},
  annote =	{Keywords: planar graph, H-minor-free, space-efficient, separator, tree decomposition}
}
Document
Locally Static, Globally Dynamic Session Types for Active Objects

Authors: Reiner Hähnle, Anton W. Haubner, and Eduard Kamburjan

Published in: OASIcs, Volume 86, Recent Developments in the Design and Implementation of Programming Languages (2020)


Abstract
Active object languages offer an attractive trade-off between low-level, preemptive concurrency and fully distributed actors: syntactically identifiable atomic code segments and asynchronous calls are the basis of cooperative concurrency, still permitting interleaving, but nevertheless being mechanically analyzable. The challenge is to reconcile local static analysis of atomic segments with the global scheduling constraints it depends on. Here, we propose an approximate, hybrid approach; At compile-time we perform a local static analysis: later, any run not complying to a global specification is excluded via runtime checks. That specification is expressed in a type-theoretic language inspired by session types. The approach reverses the usual (first global, then local) order of analysis and, thereby, supports analysis of open distributed systems.

Cite as

Reiner Hähnle, Anton W. Haubner, and Eduard Kamburjan. Locally Static, Globally Dynamic Session Types for Active Objects. In Recent Developments in the Design and Implementation of Programming Languages. Open Access Series in Informatics (OASIcs), Volume 86, pp. 1:1-1:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@InProceedings{hahnle_et_al:OASIcs.Gabbrielli.1,
  author =	{H\"{a}hnle, Reiner and Haubner, Anton W. and Kamburjan, Eduard},
  title =	{{Locally Static, Globally Dynamic Session Types for Active Objects}},
  booktitle =	{Recent Developments in the Design and Implementation of Programming Languages},
  pages =	{1:1--1:24},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-171-9},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{86},
  editor =	{de Boer, Frank S. and Mauro, Jacopo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Gabbrielli.1},
  URN =		{urn:nbn:de:0030-drops-132237},
  doi =		{10.4230/OASIcs.Gabbrielli.1},
  annote =	{Keywords: Session Types, Active Objects, Runtime Verification, Static Verification}
}
Document
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)

Authors: Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, and Ke Yi

Published in: Dagstuhl Manifestos, Volume 7, Issue 1 (2018)


Abstract
The area of Principles of Data Management (PDM) has made crucial contributions to the development of formal frameworks for understanding and managing data and knowledge. This work has involved a rich cross-fertilization between PDM and other disciplines in mathematics and computer science, including logic, complexity theory, and knowledge representation. We anticipate on-going expansion of PDM research as the technology and applications involving data management continue to grow and evolve. In particular, the lifecycle of Big Data Analytics raises a wealth of challenge areas that PDM can help with. In this report we identify some of the most important research directions where the PDM community has the potential to make significant contributions. This is done from three perspectives: potential practical relevance, results already obtained, and research questions that appear surmountable in the short and medium term.

Cite as

Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, and Ke Yi. Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). In Dagstuhl Manifestos, Volume 7, Issue 1, pp. 1-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{abiteboul_et_al:DagMan.7.1.1,
  author =	{Abiteboul, Serge and Arenas, Marcelo and Barcel\'{o}, Pablo and Bienvenu, Meghyn and Calvanese, Diego and David, Claire and Hull, Richard and H\"{u}llermeier, Eyke and Kimelfeld, Benny and Libkin, Leonid and Martens, Wim and Milo, Tova and Murlak, Filip and Neven, Frank and Ortiz, Magdalena and Schwentick, Thomas and Stoyanovich, Julia and Su, Jianwen and Suciu, Dan and Vianu, Victor and Yi, Ke},
  title =	{{Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)}},
  pages =	{1--29},
  journal =	{Dagstuhl Manifestos},
  ISSN =	{2193-2433},
  year =	{2018},
  volume =	{7},
  number =	{1},
  editor =	{Abiteboul, Serge and Arenas, Marcelo and Barcel\'{o}, Pablo and Bienvenu, Meghyn and Calvanese, Diego and David, Claire and Hull, Richard and H\"{u}llermeier, Eyke and Kimelfeld, Benny and Libkin, Leonid and Martens, Wim and Milo, Tova and Murlak, Filip and Neven, Frank and Ortiz, Magdalena and Schwentick, Thomas and Stoyanovich, Julia and Su, Jianwen and Suciu, Dan and Vianu, Victor and Yi, Ke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagMan.7.1.1},
  URN =		{urn:nbn:de:0030-drops-86772},
  doi =		{10.4230/DagMan.7.1.1},
  annote =	{Keywords: database theory, principles of data management, query languages, efficient query processing, query optimization, heterogeneous data, uncertainty, knowledge-enriched data management, machine learning, workflows, human-related data, ethics}
}
Document
Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412)

Authors: Holger H. Hoos, Frank Neumann, and Heike Trautmann

Published in: Dagstuhl Reports, Volume 6, Issue 10 (2017)


Abstract
This report documents the programme and the outcomes of Dagstuhl Seminar 16412 "Automated Algorithm Selection and Configuration", which was held October 9--14, 2016 and attended by 34 experts from 10 countries. Research on automated algorithm selection and configuration has lead to some of the most impressive successes within the broader area of empirical algorithmics, and has proven to be highly relevant to industrial applications. Specifically, high-performance algorithms for cnp-hard problems, such as propositional satisfiability (SAT) and mixed integer programming (MIP), are known to have a huge impact on sectors such as manufacturing, logistics, healthcare, finance, agriculture and energy systems, and algorithm selection and configuration techniques have been demonstrated to achieve substantial improvements in the performance of solvers for these problems. Apart from creating synergy through close interaction between the world's leading groups in the area, the seminar pursued two major goals: to promote and develop deeper understanding of the behaviour of algorithm selection and configuration techniques and to lay the groundwork for further improving their efficacy. Towards these ends, the organisation team brought together a group of carefully chosen researchers with strong expertise in computer science, statistics, mathematics, economics and engineering; a particular emphasis was placed on bringing together theorists, empiricists and experts from various application areas, with the goal of closing the gap between theory and practice.

Cite as

Holger H. Hoos, Frank Neumann, and Heike Trautmann. Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412). In Dagstuhl Reports, Volume 6, Issue 10, pp. 33-74, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@Article{hoos_et_al:DagRep.6.10.33,
  author =	{Hoos, Holger H. and Neumann, Frank and Trautmann, Heike},
  title =	{{Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412)}},
  pages =	{33--74},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{10},
  editor =	{Hoos, Holger H. and Neumann, Frank and Trautmann, Heike},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.10.33},
  URN =		{urn:nbn:de:0030-drops-69569},
  doi =		{10.4230/DagRep.6.10.33},
  annote =	{Keywords: algorithm configuration, algorithm selection, features, machine learning, optimisation, performance prediction}
}
Document
Inductive Inference and Reverse Mathematics

Authors: Rupert Hölzl, Sanjay Jain, and Frank Stephan

Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)


Abstract
The present work investigates inductive inference from the perspective of reverse mathematics. Reverse mathematics is a framework which relates the proof strength of theorems and axioms throughout many areas of mathematics in an interdisciplinary way. The present work looks at basic notions of learnability including Angluin's tell-tale condition and its variants for learning in the limit and for conservative learning. Furthermore, the more general criterion of partial learning is investigated. These notions are studied in the reverse mathematics context for uniformly and weakly represented families of languages. The results are stated in terms of axioms referring to domination and induction strength.

Cite as

Rupert Hölzl, Sanjay Jain, and Frank Stephan. Inductive Inference and Reverse Mathematics. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 420-433, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Copy BibTex To Clipboard

@InProceedings{holzl_et_al:LIPIcs.STACS.2015.420,
  author =	{H\"{o}lzl, Rupert and Jain, Sanjay and Stephan, Frank},
  title =	{{Inductive Inference and Reverse Mathematics}},
  booktitle =	{32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
  pages =	{420--433},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-78-1},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{30},
  editor =	{Mayr, Ernst W. and Ollinger, Nicolas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.420},
  URN =		{urn:nbn:de:0030-drops-49324},
  doi =		{10.4230/LIPIcs.STACS.2015.420},
  annote =	{Keywords: reverse mathematics, recursion theory, inductive inference, learning from positive data}
}
Document
Resilience in Exascale Computing (Dagstuhl Seminar 14402)

Authors: Hermann Härtig, Satoshi Matsuoka, Frank Mueller, and Alexander Reinefeld

Published in: Dagstuhl Reports, Volume 4, Issue 9 (2015)


Abstract
From September 28 to October 1, 2014, the Dagstuhl Seminar 14402 "Resilience in Exascale Computing" was held in Schloss Dagstuhl-Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. Slides of the talks and abstracts are available online.

Cite as

Hermann Härtig, Satoshi Matsuoka, Frank Mueller, and Alexander Reinefeld. Resilience in Exascale Computing (Dagstuhl Seminar 14402). In Dagstuhl Reports, Volume 4, Issue 9, pp. 124-139, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Copy BibTex To Clipboard

@Article{hartig_et_al:DagRep.4.9.124,
  author =	{H\"{a}rtig, Hermann and Matsuoka, Satoshi and Mueller, Frank and Reinefeld, Alexander},
  title =	{{Resilience in Exascale Computing (Dagstuhl Seminar 14402)}},
  pages =	{124--139},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{9},
  editor =	{H\"{a}rtig, Hermann and Matsuoka, Satoshi and Mueller, Frank and Reinefeld, Alexander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.9.124},
  URN =		{urn:nbn:de:0030-drops-48898},
  doi =		{10.4230/DagRep.4.9.124},
  annote =	{Keywords: Exascale computing, resilience, fault tolerance, manycore computers, operating systems, micro kernels, work-load balancing, checkpointing}
}
Document
Stabilising aggregation AMG

Authors: Frank Hülsemann

Published in: Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009)


Abstract
When applied to linear systems arising from scalar elliptic partial differential equations, algebraic multigrid (AMG) schemes based on aggregation exhibit a mesh size dependent convergence behaviour. As the number of iterations increases with the number of unknowns in the linear system, the computational complexity of such a scheme is non-optimal. This contribution presents a stabilisation of the aggregation AMG algorithm which adds a number of subspace projection steps at different stages of the algorithm and allows for variable cycling strategies. Numerical results illustrate the advantage of the stabilised algorithm over its original formulation.

Cite as

Frank Hülsemann. Stabilising aggregation AMG. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{hulsemann:DagSemProc.09061.17,
  author =	{H\"{u}lsemann, Frank},
  title =	{{Stabilising aggregation AMG}},
  booktitle =	{Combinatorial Scientific Computing},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9061},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.17},
  URN =		{urn:nbn:de:0030-drops-20946},
  doi =		{10.4230/DagSemProc.09061.17},
  annote =	{Keywords: Algebraic multigrid, aggregation, stabilisation}
}
Document
Reliably Capture Local Clusters in Noisy Domains From Parallel Universes

Authors: Frank Höppner and Mirko Böttcher

Published in: Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007)


Abstract
When seeking for small local patterns it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We propose a new approach that addresses this problem by exploiting temporal information which is contained in most business data sets. The algorithm enables the detection of local patterns in noisy data sets more reliable compared to the case when the temporal information is ignored. This is achieved by making use of the fact that noise does not reproduce its incidental structure but even small patterns do. In particular, we developed a method to track clusters over time based on an optimal match of data partitions between time periods.

Cite as

Frank Höppner and Mirko Böttcher. Reliably Capture Local Clusters in Noisy Domains From Parallel Universes. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{hoppner_et_al:DagSemProc.07181.9,
  author =	{H\"{o}ppner, Frank and B\"{o}ttcher, Mirko},
  title =	{{Reliably Capture Local Clusters in Noisy Domains From Parallel Universes}},
  booktitle =	{Parallel Universes and Local Patterns},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7181},
  editor =	{Michael R. Berthold and Katharina Morik and Arno Siebes},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.9},
  URN =		{urn:nbn:de:0030-drops-12617},
  doi =		{10.4230/DagSemProc.07181.9},
  annote =	{Keywords: Local pattern, time, parallel universe}
}
Document
Choreography Conformance Checking: An Approach based on BPEL and Petri Nets

Authors: Wil van der Aalst, Marlon Dumas, C. Ouyang, Anne Rozinat, and H. M. W. Verbeek

Published in: Dagstuhl Seminar Proceedings, Volume 6291, The Role of Business Processes in Service Oriented Architectures (2006)


Abstract
Recently, languages such as BPEL and WS-CDL have been proposed to describe interactions between services and their behavioral dependencies. The emergence of these languages heralds an era where richer service descriptions, going beyond WSDL-like interfaces, will be available. However, what can these richer service descriptions serve for? This talk discussed the use of event logs of web services and behavioral service descriptions as input for process mining and conformance checking. Conformance checking is the act of verifying whether or not one or more parties stick to an agreed-upon behavior, by observing their actual behavior as recorded in message logs. This talk shows that it is possible to translate BPEL business abstract processes to Petri nets and to relate SOAP messages to transitions in the Petri net. The approach has been implemented in the ProM framework.

Cite as

Wil van der Aalst, Marlon Dumas, C. Ouyang, Anne Rozinat, and H. M. W. Verbeek. Choreography Conformance Checking: An Approach based on BPEL and Petri Nets. In The Role of Business Processes in Service Oriented Architectures. Dagstuhl Seminar Proceedings, Volume 6291, pp. 1-71, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{vanderaalst_et_al:DagSemProc.06291.9,
  author =	{van der Aalst, Wil and Dumas, Marlon and Ouyang, C. and Rozinat, Anne and Verbeek, H. M. W.},
  title =	{{Choreography Conformance Checking: An Approach based on BPEL and Petri Nets}},
  booktitle =	{The Role of Business Processes in Service Oriented Architectures},
  pages =	{1--71},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6291},
  editor =	{Frank Leymann and Wolfgang Reisig and Satish R. Thatte and Wil van der Aalst},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06291.9},
  URN =		{urn:nbn:de:0030-drops-8307},
  doi =		{10.4230/DagSemProc.06291.9},
  annote =	{Keywords: Process mining, SOAP messages, BPEL, Petri nets}
}
Document
04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems

Authors: Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Pedro Jóse Marrón, Philipp Obreiter, Evaggelia Pitoura, Peter Reiher, Kai-Uwe Sattler, and Frank Seliger

Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)


Abstract
This document summarizes the results of the working group discussion on Mobile Ad-hoc NETworks (MANETs), peer-to-peer (p2p) and self-organizing systems held at the workshop on Mobile Information Management in October 2

Cite as

Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Pedro Jóse Marrón, Philipp Obreiter, Evaggelia Pitoura, Peter Reiher, Kai-Uwe Sattler, and Frank Seliger. 04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{bose_et_al:DagSemProc.04441.3,
  author =	{B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Gruenwald, Le and Marr\'{o}n, Pedro J\'{o}se and Obreiter, Philipp and Pitoura, Evaggelia and Reiher, Peter and Sattler, Kai-Uwe and Seliger, Frank},
  title =	{{04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems}},
  booktitle =	{Mobile Information Management},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4441},
  editor =	{Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.3},
  URN =		{urn:nbn:de:0030-drops-2171},
  doi =		{10.4230/DagSemProc.04441.3},
  annote =	{Keywords: MANET, P2P}
}
Document
04441 Working Group – Business Models

Authors: Birgitta König-Ries, Franz Lehner, Rainer Malaka, Florian Matthes, Philipp Obreiter, Key Pousttchi, Frank Seliger, Klaus Turowski, and Jari Veijalainen

Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)


Abstract
This document presents the results from the working group "Business Models" (WG 1) discussing the seminar topic under market aspects. Main objectives were developing a shared view of the field (i.e. matching business, technology and research interests), identifying key players and relations between them (including barriers and lessons learned so far from the 2G/2.5G market), discussing the role of business models and value chains and applying them to P2P-networks. In the concluding round the difference between traditional DB/IS applications and mobile applications is explored.

Cite as

Birgitta König-Ries, Franz Lehner, Rainer Malaka, Florian Matthes, Philipp Obreiter, Key Pousttchi, Frank Seliger, Klaus Turowski, and Jari Veijalainen. 04441 Working Group – Business Models. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{konigries_et_al:DagSemProc.04441.4,
  author =	{K\"{o}nig-Ries, Birgitta and Lehner, Franz and Malaka, Rainer and Matthes, Florian and Obreiter, Philipp and Pousttchi, Key and Seliger, Frank and Turowski, Klaus and Veijalainen, Jari},
  title =	{{04441 Working Group – Business Models}},
  booktitle =	{Mobile Information Management},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4441},
  editor =	{Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.4},
  URN =		{urn:nbn:de:0030-drops-1699},
  doi =		{10.4230/DagSemProc.04441.4},
  annote =	{Keywords: Business Models}
}
  • Refine by Author
  • 2 Obreiter, Philipp
  • 2 Seliger, Frank
  • 1 Abiteboul, Serge
  • 1 Arenas, Marcelo
  • 1 Barceló, Pablo
  • Show More...

  • Refine by Classification
  • 1 Theory of computation → Distributed computing models
  • 1 Theory of computation → Graph algorithms analysis
  • 1 Theory of computation → Object oriented constructs
  • 1 Theory of computation → Type structures

  • Refine by Keyword
  • 2 machine learning
  • 1 Active Objects
  • 1 Algebraic multigrid
  • 1 BPEL
  • 1 Business Models
  • Show More...

  • Refine by Type
  • 11 document

  • Refine by Publication Year
  • 2 2005
  • 2 2015
  • 1 2006
  • 1 2007
  • 1 2009
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail