4074 search results - page 777 / 815 » Defining Computational Aesthetics |
STOC
2010
ACM
14 years 26 days ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
ICALP
1992
Springer
14 years 26 days ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
MFPS
1989
14 years 25 days ago
1989
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...
VLDB
1989
ACM
14 years 24 days ago
1989
ACM
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
WDAG
1990
Springer
14 years 24 days ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...