3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The sharp bound of $n(n-1)$ vertices for $n\ge2$ is proved, answering Rote's rotation-assignment open problem, and assignment-based bounds extend the approach to three-dimensional rotations and partial matching at a supplied translation through branch-and-bound.
What information is needed to turn a natural-gradient direction into a useful finite update? Under a population Kullback-Leibler (KL) budget, we call a step useful if it is feasible and loses at most a fraction $\varepsilon$ of the best feasible gain along the direction. We construct a four-state exponential family who...
FlatLands provides a rigorous testbed for uncertainty-aware indoor mapping and generative completion for embodied navigation and is instantiate the task as an end-to-end monocular RGB-to-floormaps pipeline.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
