4074 search results - page 25 / 815 » Defining Computational Aesthetics |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
JC
2000
13 years 7 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
DPPI
2003
ACM
14 years 26 days ago
2003
ACM
In the context of design for experience this paper presents a review of existing models of user experience. In response to a prevalent view of experience as something individual, ...
CGI
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper focuses on an approach to modeling shapes through the use of evolutionary optimization or genetic algorithms for functionally represented geometric objects. This repres...