1591 search results - page 267 / 319 » Random lifts of graphs |
138
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
158
click to vote
WIOPT
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
130
click to vote
BROADNETS
2005
IEEE
15 years 9 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...
138
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
145
click to vote
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...