560 search results - page 58 / 112 » Level-set methods for convex optimization |
154
click to vote
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
113
click to vote
TSP
2008
15 years 3 months ago
2008
Abstract--We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is giv...
121
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
166
Voted
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
119
click to vote
SIAMSC
2008
15 years 3 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...