364 search results - page 26 / 73 » Belief Update Using Graphs |
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
ACCV
2006
Springer
14 years 4 months ago
2006
Springer
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
PODC
2010
ACM
14 years 18 days ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...