Sciweavers

1651 search results - page 19 / 331
» Measuring the Complexity of Classification Problems
Sort
View
NIPS
2008
13 years 9 months ago
Rademacher Complexity Bounds for Non-I.I.D. Processes
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 ...
Mehryar Mohri, Afshin Rostamizadeh
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
13 years 5 months ago
The complexity of partition tasks
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...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...
ICASSP
2010
IEEE
13 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
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 ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ISBI
2004
IEEE
14 years 8 months ago
Morphological Classification of Medical Images using Nonlinear Support Vector Machines
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...
Christos Davatzikos, Dinggang Shen, Zhiqiang Lao, ...
SIAMMA
2010
81views more  SIAMMA 2010»
13 years 2 months ago
The Interior Transmission Eigenvalue Problem
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...
Fioralba Cakoni, David Colton, Drossos Gintides