1105 search results - page 69 / 221 » Linear choosability of graphs |
104
click to vote
JMLR
2010
14 years 10 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
JMLR
2010
14 years 6 months ago
2010
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
DAM
2008
14 years 12 months ago
2008
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
PAMI
2006
14 years 11 months ago
2006
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...