Sciweavers

220 search results - page 11 / 44
» SMOS L1 algorithms
Sort
View
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
14 years 2 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
ANOR
2010
87views more  ANOR 2010»
13 years 7 months ago
Image denoising via solution paths
Many image denoising methods can be characterized as minimizing "loss + penalty," where the "loss" measures the fidelity of the denoised image to the data, and ...
Li Wang, Ji Zhu
CVPR
2009
IEEE
15 years 2 months ago
Half-integrality based algorithms for Cosegmentation of Images
We study the cosegmentation problem where the objective is to segment the same object (i.e., region) from a pair of images. The segmentation for each image can be cast using a p...
Chuck R. Dyer, Lopamudra Mukherjee, Vikas Singh
COMPGEOM
2004
ACM
14 years 1 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
MOC
1998
106views more  MOC 1998»
13 years 7 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan