1963 search results - page 180 / 393 » The Maximum Solution Problem on Graphs |
137
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
137
Voted
JMLR
2012
13 years 5 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
114
Voted
REX
1991
15 years 6 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
160
click to vote
SIAMIS
2010
14 years 9 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
133
Voted
COR
2010
15 years 2 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...