Sciweavers

1161 search results - page 127 / 233
» Approximation schemes for clustering problems
Sort
View
140
Voted
ESANN
1997
15 years 4 months ago
Kohonen maps versus vector quantization for data analysis
Besides their topological properties, Kohonen maps are often used for vector quantization only. These auto-organised networks are often compared to other standard and/or adaptive v...
Eric de Bodt, Michel Verleysen, Marie Cottrell
134
Voted
ICTAI
2009
IEEE
15 years 1 months ago
Real-Valued Feature Selection by Mutual Information of Order 2
The selection of features for classification, clustering and approximation is an important task in pattern recognition, data mining and soft computing. For real-valued features, th...
Rüdiger W. Brause
130
Voted
ICANN
2007
Springer
15 years 9 months ago
Towards Understanding of Natural Language: Neurocognitive Inspirations
Neurocognitive processes responsible for representation of meaning and understanding of words are investigated. First a review of current knowledge about word representation, recen...
Wlodzislaw Duch, Pawel Matykiewicz, John Pestian
140
Voted
LATIN
2010
Springer
15 years 1 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
96
Voted
TIT
2002
78views more  TIT 2002»
15 years 3 months ago
Optimal placement of training for frequency-selective block-fading channels
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
Srihari Adireddy, Lang Tong, Harish Viswanathan