4074 search results - page 158 / 815 » Defining Computational Aesthetics |
AGP
1994
IEEE
14 years 1 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
CATS
2006
13 years 11 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
NIPS
1998
13 years 11 months ago
1998
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
WSC
1998
13 years 11 months ago
1998
Bootstrapping is a resampling technique that requires less computer time than simulation does. Bootstrapping -like simulation-must be defined for each type of application. This pa...
AUTOMATICA
2008
13 years 10 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...