Sciweavers

3328 search results - page 230 / 666
» On Plateaued Functions and Their Constructions
Sort
View
PPDP
2007
Springer
16 years 22 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
INFOVIS
2005
IEEE
16 years 6 days ago
Revealing Structure within Clustered Parallel Coordinates Displays
In order to gain insight into multivariate data, complex structures must be analysed and understood. Parallel coordinates is an excellent tool for visualizing this type of data bu...
Jimmy Johansson, Patric Ljung, Mikael Jern, Matthe...
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
15 years 12 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
IWANN
2001
Springer
15 years 11 months ago
Evolving RBF Neural Networks
This paper is focused on determining the parameters of radial basis function neural networks (number of neurons, and their respective centers and radii) automatically. While this ...
Víctor Manuel Rivas Santos, Pedro A. Castil...
IDA
1997
Springer
15 years 10 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen