5153 search results - page 128 / 1031 » Introduction to Randomized Algorithms |
133
Voted
CCCG
2010
15 years 4 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
295
Voted
PAMI
2010
15 years 29 days 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...
108
Voted
SAGA
2007
Springer
15 years 8 months ago
2007
Springer
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
140
click to vote
SIAMJO
2010
14 years 9 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
142
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...