3250 search results - page 316 / 650 » Parameterized Learning Complexity |
146
Voted
IEEEMM
2007
15 years 4 months ago
2007
— Microarray technology offers a high throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small s...
169
click to vote
JMLR
2010
15 years 3 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
147
click to vote
PKDD
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
155
click to vote
CVPR
2011
IEEE
15 years 10 days ago
2011
IEEE
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
162
click to vote
JMLR
2010
14 years 11 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...