Sciweavers

3143 search results - page 225 / 629
» Minimization of entropy functionals
Sort
View
TALG
2010
158views more  TALG 2010»
14 years 11 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ICC
2008
IEEE
133views Communications» more  ICC 2008»
15 years 11 months ago
Memoryless Relay Strategies for Two-Way Relay Channels: Performance Analysis and Optimization
— We consider relaying strategies for two-way relay channels, where two terminals transmits simultaneously to each other with the help of relays. A memoryless system is considere...
Tao Cui, Jörg Kliewer
AUSAI
2007
Springer
15 years 10 months ago
The Detrimentality of Crossover
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
Andrew Czarn, Cara MacNish, Kaipillil Vijayan, Ber...
ISCAS
2005
IEEE
214views Hardware» more  ISCAS 2005»
15 years 10 months ago
Blind separation of statistically independent signals with mixed sub-Gaussian and super-Gaussian probability distributions
— In the context of Independent Component Analysis (ICA), we propose a simple method for online estimation of activation functions in order to blindly separate instantaneous mixt...
Muhammad Tufail, Masahide Abe, Masayuki Kawamata
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 8 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri