1963 search results - page 234 / 393 » The Maximum Solution Problem on Graphs |
148
Voted
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
104
Voted
SIGCOMM
1992
ACM
15 years 4 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
91
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
120
Voted
TOG
2008
15 years 20 days ago
2008
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
112
click to vote
JMLR
2010
14 years 7 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...