We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
This paper considers the role of network connectivity in supporting context-sensitive applications. A range of context-sensitive applications are analysed with respect to connectiv...
Keith Cheverst, Nigel Davies, Keith Mitchell, Adri...
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...