Sciweavers

4074 search results - page 324 / 815
» Defining Computational Aesthetics
Sort
View
IJON
2006
89views more  IJON 2006»
15 years 6 months ago
Flexible kernels for RBF networks
In this paper we propose a novel approach for modeling kernels in Radial Basis Function networks. The method provides an extra degree of flexibility to the kernel structure. This ...
André O. Falcão, Thibault Langlois, ...
JC
2008
92views more  JC 2008»
15 years 6 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier
JDI
2006
45views more  JDI 2006»
15 years 6 months ago
The Next Killer Ap
: The next `killer ap' is a term the software development community uses to describe its great quest for advancing technology by defining and meeting users' needs and wan...
JGAA
2006
75views more  JGAA 2006»
15 years 6 months ago
Upward Planar Drawings and Switch-regularity Heuristics
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
Walter Didimo
SIAMJO
2008
139views more  SIAMJO 2008»
15 years 6 months ago
An Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
Florian Jarre, Franz Rendl