Sciweavers

31 search results - page 3 / 7
» An accelerated gradient method for trace norm minimization
Sort
View
SIAMJO
2002
159views more  SIAMJO 2002»
13 years 6 months ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
ICPR
2008
IEEE
14 years 1 months ago
Robust estimation of foreground in surveillance videos by sparse error estimation
Frames of videos with static background and dynamic foreground can be viewed as samples of signals that vary slowly in time with sparse corruption caused by foreground objects. We...
Mert Dikmen, Thomas S. Huang
CGF
2008
150views more  CGF 2008»
13 years 6 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 1 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CIKM
2011
Springer
12 years 6 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han