4074 search results - page 232 / 815 » Defining Computational Aesthetics |
87
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
101
Voted
CORR
2008
Springer
15 years 25 days ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
86
Voted
ENTCS
2008
15 years 25 days ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
89
Voted
FSS
2008
15 years 25 days ago
2008
In this paper we propose computationally simple, pointwise formulas for extended t-norms and t-conorms on fuzzy truth values. The complex convolutions of the extended operations a...
75
Voted
BMCBI
2006
15 years 24 days ago
2006
Background: Trait heterogeneity, which exists when a trait has been defined with insufficient specificity such that it is actually two or more distinct traits, has been implicated...