Sciweavers

17185 search results - page 3066 / 3437
» Computational and Quantitative Studies
Sort
View
IWPEC
2010
Springer
15 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
MASS
2010
248views Communications» more  MASS 2010»
15 years 5 months ago
Adaptive exploitation of cooperative relay for high performance communications in MIMO ad hoc networks
With the popularity of wireless devices and the increase of computing and storage resources, there are increasing interests in supporting mobile computing techniques. Particularly...
Shan Chu, Xin Wang
MOBIHOC
2010
ACM
15 years 5 months ago
The intrusion detection in mobile sensor network
Intrusion detection is an important problem in sensor networks. Prior works in static sensor environments show that constructing sensor barriers with random sensor deployment can ...
Gabriel Yik Keung, Bo Li, Qian Zhang
MOBIHOC
2010
ACM
15 years 5 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
MOBIHOC
2010
ACM
15 years 5 months ago
Spectrum pricing games with bandwidth uncertainty and spatial reuse in cognitive radio networks
In cognitive radio networks (CRN), primary users can lease out their unused bandwidth to secondary users in return for a fee. We study price competition in a CRN with multiple pri...
Gaurav S. Kasbekar, Saswati Sarkar
« Prev « First page 3066 / 3437 Last » Next »