688 search results - page 99 / 138 » General Partitioning on Random Graphs |
124
click to vote
VALUETOOLS
2006
ACM
15 years 6 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
113
Voted
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
118
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
115
Voted
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
165
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...