Sciweavers

736 search results - page 42 / 148
» Approximating the Number of Network Motifs
Sort
View
FOCS
2000
IEEE
15 years 2 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
SECON
2008
IEEE
15 years 4 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
MASCOTS
1998
14 years 11 months ago
Performance Analysis of Cellular Mobile Communication Networks Supporting Multimedia Services
This paper illustrates the development of an approximate analytical model for a communication network providing integrated services to a population of mobile users, and presents p...
Marco Ajmone Marsan, Salvatore Marano, Carlo Mastr...
FOCS
2000
IEEE
15 years 2 months ago
Hierarchical Placement and Network Design Problems
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
Sudipto Guha, Adam Meyerson, Kamesh Munagala
DCOSS
2007
Springer
15 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev