4074 search results - page 159 / 815 » Defining Computational Aesthetics |
124
Voted
CJ
2010
15 years 3 months ago
2010
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
135
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
130
Voted
ACTA
2006
15 years 3 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
121
click to vote
ENTCS
2008
15 years 3 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
108
click to vote
JAR
2008
15 years 3 months ago
2008
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela, has a formally defined semantics. We show how we ca...