5606 search results - page 40 / 1122 » Randomization Techniques for Graphs. |
APVIS
2007
13 years 10 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
CSCLP
2007
Springer
14 years 3 months ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...