Sciweavers

5659 search results - page 204 / 1132
» Comparing Clusterings in Space
Sort
View
87
Voted
PIMRC
2008
IEEE
15 years 10 months ago
Maximum likelihood based methods for OFDM intercarrier spacing characterization
— One of the main task to be done by a cognitive receiver is to sense its spectral environment in order to distinguish surrounding systems from each others. Actually most systems...
Abdelaziz Bouzegzi, Philippe Ciblat, Pierre Jallon
ACSC
2002
IEEE
15 years 9 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
Krisztián Monostori, Arkady B. Zaslavsky, H...
GECCO
2010
Springer
181views Optimization» more  GECCO 2010»
15 years 8 months ago
Evolving neural networks in compressed weight space
We propose a new indirect encoding scheme for neural networks in which the weight matrices are represented in the frequency domain by sets of Fourier coefficients. This scheme exp...
Jan Koutnik, Faustino J. Gomez, Jürgen Schmid...
MASCOTS
2004
15 years 5 months ago
Performance Characterisation and Verification of JavaSpaces Based on Design of Experiments
In the ever increasing world of distributed systems, different middleware implementations can be compared qualitatively or quantitatively. Existing evaluation techniques are often...
Frederic Hancke, Tom Dhaene, Jan Broeckhove
JCO
2010
90views more  JCO 2010»
15 years 2 months ago
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s ...
Geng-sheng Zhang, Yu-qin Yang