Sciweavers

1722 search results - page 21 / 345
» On the sample mean of graphs
Sort
View
IJCAI
2003
14 years 11 months ago
Evaluating Classifiers by Means of Test Data with Noisy Labels
Often the most expensive and time-consuming task in building a pattern recognition system is col­ lecting and accurately labeling training and testing data. In this paper, we exp...
Chuck P. Lam, David G. Stork
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 11 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss
GLOBECOM
2010
IEEE
14 years 8 months ago
Novel Robust Blind Equalizer for QAM Signals Using Iterative Weighted-Least-Mean-Square Algorithm
In this paper, we propose a novel blind equalizer which can deal with high-order modulated QAM (quadrature amplitude modulation) signals. This new scheme is based on the signal sel...
Kun Yan, Hsiao-Chun Wu, Dongxin Xu, S. S. Iyengar
CSL
2010
Springer
14 years 11 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche