1604 search results - page 25 / 321 » Regularization on Discrete Spaces |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
CAAN
2007
Springer
14 years 1 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
JMLR
2008
13 years 7 months ago
2008
Harmonic analysis and diffusion on discrete data has been shown to lead to state-of-theart algorithms for machine learning tasks, especially in the context of semi-supervised and ...
APAL
2010
13 years 7 months ago
2010
Let C() denote the class of all cardinal sequences of length associated with compact scattered spaces. Also put C() = {f C() : f(0) = = min[f() : < ]}. If is a cardinal an...
JMIV
2008
13 years 7 months ago
2008
Every stereovision application must cope with the correspondence problem. The space of the matching variables, often consisting of spatial coordinates, intensity and disparity, is...