Sciweavers

7 search results - page 1 / 2
» Random mappings with exchangeable in-degrees
Sort
View
RSA
2008
94views more  RSA 2008»
13 years 4 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
JCP
2008
121views more  JCP 2008»
13 years 4 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 2 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
EUROPAR
2000
Springer
13 years 8 months ago
Impact of PE Mapping on Cray T3E Message-Passing Performance
The aim of this paper is to study the influence of processor mapping on message passing performance of two different parallel computers: the Cray T3E and the SGI Origin 2000. For t...
Eduardo Huedo, Manuel Prieto, Ignacio Martí...
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
13 years 10 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai