736 search results - page 55 / 148 » Approximating the Number of Network Motifs |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
SIROCCO
2004
14 years 11 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
VTC
2007
IEEE
15 years 4 months ago
2007
IEEE
— The characterization of downlink traffic power is an important issue for the design of efficient call admission control (CAC) and radio resource management (RRM) procedures. In...
NIPS
2008
14 years 11 months ago
2008
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...