1651 search results - page 19 / 331 » Measuring the Complexity of Classification Problems |
122
click to vote
NIPS
2008
15 years 3 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
115
click to vote
COMPLEXITY
2010
14 years 11 months ago
2010
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
129
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
142
Voted
ISBI
2004
IEEE
16 years 3 months ago
2004
IEEE
The wavelet decomposition of a high-dimensional shape transformation posed in a mass-preserving framework is used as a morphological signature of a brain image. Population differe...
88
Voted
SIAMMA
2010
14 years 9 months ago
2010
We consider the inverse problem of determining the spherically symmetric index of refraction n(r) from a knowledge of the corresponding transmission eigenvalues (which can be deter...