Sciweavers

4074 search results - page 159 / 815
» Defining Computational Aesthetics
Sort
View
CJ
2010
114views more  CJ 2010»
13 years 10 months ago
Using the Relational Model to Capture Topological Information of Spaces
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...
Patrick Erik Bradley, Norbert Paul
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 10 months ago
Quantifying Homology Classes
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...
Chao Chen, Daniel Freedman
ACTA
2006
74views more  ACTA 2006»
13 years 10 months ago
Linearly bounded infinite graphs
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...
Arnaud Carayol, Antoine Meyer
ENTCS
2008
72views more  ENTCS 2008»
13 years 10 months ago
Towards a Notion of Transaction in Graph Rewriting
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 ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
JAR
2008
81views more  JAR 2008»
13 years 10 months ago
Automatic Symmetry Detection for Promela
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...
Alastair F. Donaldson, Alice Miller