Sciweavers

70 search results - page 4 / 14
» Distributed Approximation of Cellular Coverage
Sort
View
DCOSS
2009
Springer
15 years 4 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
ICCD
2001
IEEE
119views Hardware» more  ICCD 2001»
15 years 6 months ago
A Functional Validation Technique: Biased-Random Simulation Guided by Observability-Based Coverage
We present a simulation-based semi-formal verification method for sequential circuits described at the registertransfer level. The method consists of an iterative loop where cove...
Serdar Tasiran, Farzan Fallah, David G. Chinnery, ...
100
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
Downlink beamforming algorithms with inter-cell interference in cellular networks
— We study the issue of handling unknown inter-cell interference in multi-cell environments with antenna arrays at the base stations. First, we demonstrate that the presence of u...
Tianmin Ren, Richard J. La
77
Voted
COCOON
2005
Springer
15 years 3 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
BMCBI
2007
154views more  BMCBI 2007»
14 years 9 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...