In this paper, we propose a novel component-wise smoothing algorithm that constructs a hierarchy (or family) of smoothened log-likelihood surfaces. Our approach first smoothens th...
We propose a novel HMM-based framework to accurately transliterate unseen named entities. The framework leverages features in letteralignment and letter n-gram pairs learned from ...
Bing Zhao, Nguyen Bach, Ian R. Lane, Stephan Vogel
In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive ...
Miguel Cazorla, Francisco Escolano, Domingo Gallar...
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
This paper presents a distributed multi-robot system designed to solve a team-based search and destroy task. The project was divided into two phases. The initial phase was used to...
J. T. McClain, Bradley J. Wimpey, D. H. Barnhard, ...