5606 search results - page 18 / 1122 » Randomization Techniques for Graphs. |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
RSA
2006
13 years 7 months ago
2006
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
JCT
2008
13 years 7 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...