2079 search results - page 95 / 416 » Universality of random graphs |
113
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
126
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Bayes statistics and statistical physics have the common mathematical structure, where the log likelihood function corresponds to the random Hamiltonian. Recently, it was discovere...
116
click to vote
COMBINATORICA
2006
15 years 4 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
155
click to vote
GC
2011
Springer
14 years 8 months ago
2011
Springer
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
153
click to vote
CCS
2006
ACM
15 years 8 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...