An Information Gain Formulation for Active Volumetric 3D Reconstruction Stefan Isler, Reza Sabzevari, Jeffrey Delmerico and Davide Scaramuzza Abstract— We consider the problem of next-best view selection for volumetric

Source URL: rpg.ifi.uzh.ch

• 3D computer graphics
• Computer graphics
• 3D imaging
• Computer vision
• Voxel
• 3D reconstruction
• Volume mesh
• Entropy
• Build
• Information theory

On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling Carsten Saathoff, Stefan Scheglmann, and Steffen Staab Institute for Web Science and Technologies University of Koblenz-Landau, Germany http://w

Source URL: ceur-ws.org

Applicability of ASP-based Problem Solving on Tree Decompositions Bernhard Bliem, Reinhard Pichler and Stefan Woltran Institute of Information Systems, Vienna University of Technology Favoritenstrasse 9–11; A-1040 Wien

Source URL: dbai.tuwien.ac.at

LNCSA Standard Framework for Timetabling Problems

Source URL: stefan.buettcher.org

• Constraint programming
• Mathematical optimization
• Artificial intelligence
• Theoretical computer science
• Applied mathematics
• Constraint logic programming
• NP-hard problems
• Operations research
• Genetic algorithm
• Nurse scheduling problem
• Constrained optimization

Mechanism Design by Creditability? Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich, Switzerland Abstract. This paper attends to the pro

Source URL: disco.ethz.ch

• Game theory
• Mechanism design
• VickreyClarkeGroves mechanism
• Nash equilibrium
• Mathematics
• Problem solving
• Decision-making

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Source URL: www.bedewell.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• NP-complete problems
• Complexity classes
• Logic in computer science
• Finite model theory
• Parameterized complexity
• Resolution
• Exponential time hypothesis
• Boolean satisfiability problem
• Conjunctive normal form

Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis

Source URL: stefan.buettcher.org

• Computational complexity theory
• Theory of computation
• Mathematics
• NP-complete problems
• Set cover problem
• NP
• Dominating set
• Approximation algorithm
• Metric k-center
• Optimization problem
• Reduction
• P versus NP problem

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Source URL: ad-publications.informatik.uni-freiburg.de

• NP-complete problems
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Dominating set
• A* search algorithm
• Optimization problem
• Minimum spanning tree
• Shortest path problem
• Treewidth
• Flow network

Combinatorial Agency with Audits Stefan Schmid Chair for Efficient Algorithms Computer Science Department TU Munich, Germany

Source URL: disco.ethz.ch

• Algebraic geometry
• Field theory
• Valuation
• Mechanism design
• Principalagent problem
• Constructible universe

AUTOMATIC FOREGROUND-BACKGROUND REFOCUSING Alexander Loktyushin and Stefan Harmeling Max Planck Institute for Biological Cybernetics, T¨ubingen, Germany ABSTRACT A challenging problem in image restoration is to recover

Source URL: people.tuebingen.mpg.de