592 search results - page 59 / 119 » Crossing numbers of random graphs |
143
Voted
ENTCS
2008
15 years 5 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
144
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
149
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
175
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
152
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...