106 search results - page 12 / 22 » Almost random graphs with simple hash functions |
IH
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
JAIR
2006
14 years 9 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
TON
2008
14 years 9 months ago
2008
Abstract--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 fail...
ICWN
2008
14 years 11 months ago
2008
Authentic program modification is very important for a multi-application smart card system since applications in the system are realized after the issuance of the smart card. In t...
65
Voted
SIGMETRICS
2005
ACM
15 years 3 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...