13214 search results - page 195 / 2643 » Pseudorandomness for network algorithms |
175
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
219
click to vote
AB
2008
Springer
16 years 28 days ago
2008
Springer
A specific class of ODEs has been shown to be adequate to describe the essential features of the complex dynamics of Gene-Regulatory Networks (GRN). But, the effective exploitatio...
179
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
173
click to vote
EPIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
188
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We characterize the stability region of wireless, single-hop networks with time-varying imperfect channels. We define a joint scheduling and transmission rate control policy th...