5606 search results - page 160 / 1122 » Randomization Techniques for Graphs. |
CIKM
2008
Springer
14 years 24 days ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
AI
2008
Springer
13 years 11 months ago
2008
Springer
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
JCT
2010
13 years 5 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
DIMVA
2009
13 years 12 months ago
2009
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
SSDBM
2010
IEEE
13 years 8 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...