In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
Non-linear dimensionality reductionmethods are powerful techniques to deal with
high-dimensional datasets. However, they often are susceptible to local minima
and perform poorly ...
Andreas Geiger (Karlsruhe Institute of Technology)...
In homing tasks, the goal is often not marked by visible objects but must be inferred from the spatial relation to the visual cues in the surrounding scene. The exact computation o...
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...
The paper presents a novel coding technique based on approximate geometry for images taken from arbitrary recording positions around a 3-D scene. Such data structures occur in ima...