Sciweavers

736 search results - page 49 / 148
» Approximating the Number of Network Motifs
Sort
View
IPCCC
2007
IEEE
15 years 4 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
INFOCOM
2010
IEEE
14 years 8 months ago
Asymptotic Analysis of Precoded Small Cell Networks
—In this paper, we study precoded MIMO based small cell networks. We derive the theoretical sum-rate capacity, when multi-antenna base stations transmit precoded information to i...
Sreenath Ramanath, Mérouane Debbah, Eitan A...
ADHOCNOW
2005
Springer
15 years 3 months ago
Location Tracking in Mobile Ad Hoc Networks Using Particle Filters
Mobile ad hoc networks (MANET) are dynamic networks formed on-the-fly as mobile nodes move in and out of each others’ transmission ranges. In general, the mobile ad hoc networki...
Rui Huang, Gergely V. Záruba
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 2 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
INFOCOM
2003
IEEE
15 years 3 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos