Sciweavers

1172 search results - page 21 / 235
» Path Algorithms on Regular Graphs
Sort
View
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 1 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
JMLR
2012
11 years 10 months ago
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
Rahul Mazumder, Trevor Hastie
AAIM
2008
Springer
91views Algorithms» more  AAIM 2008»
14 years 2 months ago
Graphs and Path Equilibria
Stéphane Le Roux