560 search results - page 82 / 112 » Level-set methods for convex optimization |
106
click to vote
GD
2005
Springer
15 years 7 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
161
click to vote
PAMI
2012
13 years 4 months ago
2012
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
174
click to vote
JMLR
2010
14 years 8 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
100
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
131
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...