For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanatha...
This paper introduces a novel approach towards direct interaction with large display systems. Monocular computer vision is utilised to avoid restraints imposed by input devices. T...
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Abstract: The vision process is very complex and requires for its realization in artificial systems a fundamentally new technology for systems generation. This must be based on pr...