Max-Planck-Institut für Softwaresysteme AlgorithmsandComplexity Group am Indian Institute of Technology in Kanpur Partner: Max-Planck-Institut für Informatik Algorithm Group am TATA Institute for Fundamental [...] zwei Millionen Euro des indischen "Department of Science and Technology" (DST) unterstützt. Die neuen Forschungsgruppen im Überblick: Algorithm Group am Indian Institute of Technology (IIT) in Delhi Partner: [...] Partner: Max-Planck-Institut für Informatik Graphics and Vision Group am Indian Institute of Technology in Delhi Partner: Max-Planck-Institut für Informatik Data Management Group am Indian Institute of
IT-Security, Privacy and Accountability, the recently renewed Cluster of Excellence "Multimodal Computing and Interaction", the German Research Center for Artificial Intelligence (DFKI), and the Intel Visual [...] Informatics and Saarland University have constructed a menu optimizer for a GUI builder. Based on a model of user performance, MenuOptimizer evaluates the efficiency of the current menu and suggests im [...] possible menu systems – which is beyond any manageable limit. Designing user interfaces is a complex, expensive, and time-consuming process. To support the software developers, computer scientists from Saarbrücken
movement is computed using a new, very robust and also fast approach. This represents the video images and the tracked person through implicit functions, and then attempts to reconcile these. In contrast [...] sophisticated and comparable to marker-based approaches. It is, however, clearly more flexible and works without as many restrictive constraints. Thus, the new method functions without a green screen, and without [...] vehicles, for example to recognize pedestrians and their movements in the vicinity of an automobile. Moreover, motion capture processes are used in the film and computer game industries. Virtual actors (avatars)
Edinburgh> and <Edinburgh, is in, Scotland> demonstrate that the object “id2” is written by id1, that id1 is born in Edinburgh, and that Edinburgh is in Scotland. Search in RDF graphs Also, complex relationships [...] triplets, each of which corresponds to an edge and an associated node pair in the data graph. A triplet consists in RDF writing of a subject, a predicate and an object. In the graph, this corresponds with [...] data and indexed it using search trees, so that any triple pattern can be evaluated very quickly. But this is not enough, however; the users are mostly interested in larger inter- relationships and thus
DEPT. 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3008 Email albrecht@mpi-inf.mpg.de Fabian Müller DEPT. 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3009Email [...] Software EpiExplorer and RnBeads: Integrative Analysis of Epigenomic Data EpiExplorer and RnBeads: Integrative Analysis of Epigenomic Data Felipe Albrecht & Fabian Müller EpiExplorer and RnBeads: Integrative [...] facilitate the interpretation and integration of such epigenetic layers of molecular information: EpiExplorer allows for an integrative view and interactive exploration of genomic and epigenomic features based
DEPT. 1 AlgorithmsandComplexity Phone +49 681 9325-1016 Email villars@mpi-inf.mpg.de Improving Flat Panel Displays by Discrete Optimization Energy Efficient Algorithms From Routing to Pricing and Learning: [...] linear-time algorithm for computing the approximate maximum matching in general graphs, which can achieve an arbitrarily small approximation ratio. Ran Duan DEPT. 1 AlgorithmsandComplexity Phone +49 681 [...] important advances in polyhedral combinatorics, graph theory, andalgorithm design. In a matching problem, we are given a graph with a set of vertices and edges. We want a matching, which is a subset of the given
Optimization Query Complexity: From Theory of Evolutionary Algorithms to Mastermind Query Complexity: From Theory of Evolutionary Algorithms to Mastermind Benjamin Doerr Query Complexity: From Theory of [...] the area of query complexity In addition to a foundationally-based interest, there are also practical grounds for the investigation of query complexities. Evolutionary algorithmsand other randomized [...] advance on a problem that has fascinated mathematicians and computer scientists for more than 30 years. Benjamin Doerr DEPT. 1 AlgorithmsandComplexityPhone +49 681 9325-1004Email doerr@mpi-inf.mpg.de Improving
ratios, by presenting sublinear-approximation algorithms for the above variant of the problem. Our algorithm is obtained by combining algorithmic pricing and geometric techniques. These results suggest that [...] research direction in obtaining improved approximation algorithms for such pricing problems. Khaled Elbassioni DEPT. 1 AlgorithmsandComplexityPhone +49 681 9325-1007Email elbassio@mpi-inf.mpg.deInternet [...] Optimization Approximation Algorithms for Profi t-maximizing Pricing Problems Approximation Algorithms for Profi t-maximizing Pricing Problems Khaled Elbassioni Approximation Algorithms for Profi t-maximizing
Energy Efficient Algorithms From Routing to Pricing and Learning: Why Are They Hard to Compute? Computation of Equilibrium Prices Rule-based Product Confi guration Approximation Algorithms for Profi t-maximizing [...] industry and economy, the principle of product lines plays a great role. In this context, different products, based on a preferably high number of identical components, are grouped together and jointly [...] its flexibility. Rules can easily be adapted to the type of products being configured and the associated components and the respective area of use. The desired level of detail can be chosen freely: Thus,
relatively simple combinatorial algorithm. Ran Duan DEPT. 1 AlgorithmsandComplexity Phone +49 681 9325-1009 Email duanran@mpi-inf.mpg.de Kurt Mehlhorn DEPT. 1 AlgorithmsandComplexity Phone +49 681 9325-1000 [...] supply and demand balance out. But what happens in an economy with many goods, many suppliers, and many buyers? The market models of Fisher and Walras Already in the 19th century, Fisher (1890) and Walras [...] proven by Arrow and Debreu. Arrow and Debreu were awarded the Nobel Prize in Economics for that and for other achievements. Their proof is nevertheless purely a proof of existence and does not produce