721 search results - page 65 / 145 » Almost universal graphs |
MSE
2005
IEEE
14 years 4 months ago
2005
IEEE
Almost all universities offer introductory courses that focus on microcontroller-based systems and embedded programming. Advanced course offerings vary, and are often not availabl...
JEI
2006
13 years 11 months ago
2006
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
ICNP
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
SIGMETRICS
2005
ACM
14 years 4 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...