398 search results - page 40 / 80 » Critical exponents of graphs |
124
Voted
ESORICS
2011
Springer
14 years 16 days ago
2011
Springer
The use of server virtualization has been growing steadily, but many enterprises still are reluctant to migrate critical workloads to such infrastructures. One key inhibitor is the...
108
click to vote
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
120
click to vote
TSP
2008
15 years 20 days ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
197
Voted
PVLDB
2010
14 years 7 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
120
Voted
ASPDAC
2001
ACM
15 years 4 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...