170 search results - page 5 / 34 » k-Wise Independent Random Graphs |
PAMI
2010
13 years 6 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
PROPERTYTESTING
2010
13 years 5 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
RSA
2010
13 years 6 months ago
2010
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
ACL
2009
13 years 5 months ago
2009
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...