Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
This paper considers a method for learning a distance metric in a fingerprinting system which identifies a query content by measuring the distance between the fingerprint of th...
This paper describes a study that investigates the use of a multimodal technology in a learning task. In relation to the recent interest in learning as a multimodal experience, th...
Stamatina Anastopoulou, Mike Sharples, Chris Baber