760 search results - page 93 / 152 » Algorithms for finding clique-transversals of graphs |
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
MICCAI
2004
Springer
14 years 9 months ago
2004
Springer
This paper introduces a new technique to detect the coronary arteries as well as other heart's peripheral vessels. After finding the location of the myocardium through a graph...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...