1259 search results - page 68 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
133
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
147
click to vote
SACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
130
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
155
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
118
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...