Sciweavers

736 search results - page 45 / 148
» Approximating the Number of Network Motifs
Sort
View
INFOCOM
2012
IEEE
13 years 9 days ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
JMLR
2010
137views more  JMLR 2010»
14 years 4 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
15 years 3 months ago
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
Wei Lou, Jie Wu
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 4 months ago
Study of Throughput and Delay in Finite-Buffer Line Networks
—In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such...
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri
IPPS
2009
IEEE
15 years 4 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...