Sciweavers

5595 search results - page 451 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CSDA
2006
98views more  CSDA 2006»
15 years 7 months ago
Frequency estimation of undamped exponential signals using genetic algorithms
: In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation usi...
Amit Mitra, Debasis Kundu, Gunjan Agrawal
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 1 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
NHM
2010
83views more  NHM 2010»
15 years 1 months ago
Schwarz waveform relaxation algorithms for semilinear reaction-diffusion equations
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...
Filipa Caetano, Martin J. Gander, Laurence Halpern...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 1 months ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
16 years 1 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher