1542 search results - page 121 / 309 » The metamathematics of random graphs |
100
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
125
click to vote
SDM
2010
SIAM
15 years 3 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
101
Voted
GBRPR
2009
Springer
15 years 6 months ago
2009
Springer
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
108
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
106
Voted
RSA
2006
15 years 1 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...