4074 search results - page 377 / 815 » Defining Computational Aesthetics |
164
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
168
click to vote
SSPR
2000
Springer
15 years 10 months ago
2000
Springer
An algorithm for learning structural patterns given in terms of Attributed Relational Graphs (ARG's) is presented. The algorithm, based on inductive learning methodologies, pr...
173
click to vote
SGP
2004
15 years 9 months ago
2004
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
188
click to vote
WSC
2008
15 years 9 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
177
click to vote
CAISE
2006
Springer
15 years 8 months ago
2006
Springer
: Integrity checking is aimed at determining whether an operation execution violates a given integrity constraint. To perform this computation efficiently, several incremental meth...