4074 search results - page 137 / 815 » Defining Computational Aesthetics |
IJBC
2006
13 years 10 months ago
2006
Graph automata define symbol dynamics on graph structures, which has capability of generating structures in addition to state transition. The rules of the graph automata are unifo...
TYPES
1998
Springer
14 years 2 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
DCG
2010
13 years 10 months ago
2010
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
ECCV
2002
Springer
15 years 5 days ago
2002
Springer
In this paper we define a function R(P) which is defined for any polygon P and which maps a given polygon P into a number from the interval (0, 1]. The number R(P) can be used as a...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...