Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
eLearning is developing at an ever increasing rate as universities and colleges recognize its vast potential to reach a deeper and fragmented student pool. For a while, eLearning ...
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
We introduce a new class of probabilistic latent variable model called the Implicit Mixture of Conditional Restricted Boltzmann Machines (imCRBM) for use in human pose tracking. K...
Graham Taylor, Leonid Sigal, David Fleet, Geoffrey...