1949 search results - page 171 / 390 » Random graphs on surfaces |
132
click to vote
ENTCS
2008
15 years 4 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 ...
160
click to vote
JMLR
2012
13 years 7 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
157
click to vote
VISSOFT
2005
IEEE
15 years 10 months ago
2005
IEEE
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...
136
click to vote
ARSCOM
2002
15 years 4 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
134
click to vote
STOC
2009
ACM
16 years 5 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...