1199 search results - page 111 / 240 » Graph Theory |
162
click to vote
CN
2010
15 years 23 days ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
164
click to vote
SASN
2004
ACM
15 years 9 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
145
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
149
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...