Sciweavers

3116 search results - page 229 / 624
» Positively dependent types
Sort
View
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 10 months ago
On the Complexity of Approximating the VC Dimension
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-...
Elchanan Mossel, Christopher Umans
HUC
1999
Springer
15 years 10 months ago
The Role of Connectivity in Supporting Context-Sensitive Applications
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...
PODS
1998
ACM
116views Database» more  PODS 1998»
15 years 10 months ago
Complexity of Answering Queries Using Materialized Views
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...
Serge Abiteboul, Oliver M. Duschka
RT
1998
Springer
15 years 10 months ago
Global Ray-Bundle Tracing with Hardware Acceleration
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...
László Szirmay-Kalos, Werner Purgath...
169
Voted
ICTAI
1994
IEEE
15 years 10 months ago
A Distributed Scheduling Framework
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 ...
Carla P. Gomes, Austin Tate, Lyn Thomas