688 search results - page 122 / 138 » General Partitioning on Random Graphs |
162
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
141
click to vote
BROADNETS
2005
IEEE
15 years 10 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
159
click to vote
APPROX
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
128
click to vote
DAC
2000
ACM
16 years 6 months ago
2000
ACM
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
138
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...