3378 search results - page 111 / 676 » A universe of binding and computation |
SODA
1992
ACM
14 years 11 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
173
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
113
click to vote
PEPM
1997
ACM
15 years 2 months ago
1997
ACM
We present the design of a dynamic compilation system for C. Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a bi...
CG
2000
Springer
14 years 9 months ago
2000
Springer
Computers have recently emerged as commonplace on the scene in a record number of university art departments. This rapid change has created the need for new curriculum in the comp...
100
click to vote
STOC
2012
ACM
13 years 10 days ago
2012
ACM
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...