Sciweavers

5595 search results - page 119 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
JC
2006
97views more  JC 2006»
15 years 4 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings II
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Stephan Dahlke, Erich Novak, Winfried Sickel
DAGSTUHL
2004
15 years 6 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 10 months ago
Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones
This paper presents a hybrid approach to detect source-code clones that combines evolutionary algorithms and clustering. A case-study is conducted on a small C++ code base. The pr...
Andrew Sutton, Huzefa H. Kagdi, Jonathan I. Maleti...
TSP
2008
115views more  TSP 2008»
15 years 4 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
ICTAI
2008
IEEE
15 years 11 months ago
Knee Point Detection on Bayesian Information Criterion
The main challenge of cluster analysis is that the number of clusters or the number of model parameters is seldom known, and it must therefore be determined before clustering. Bay...
Qinpei Zhao, Mantao Xu, Pasi Fränti