Sciweavers

349 search results - page 49 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
JCO
2006
234views more  JCO 2006»
13 years 7 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 2 months ago
View Planning of Multiple Active Cameras for Wide Area Surveillance
— This paper describes a view planning of multiple cameras for tracking multiple persons for surveillance purposes. When only a few active cameras are used to cover a wide area, ...
Noriko Takemura, Jun Miura
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
MOBICOM
2005
ACM
14 years 1 months ago
Barrier coverage with wireless sensors
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
Santosh Kumar, Ten-Hwang Lai, Anish Arora
ITC
1995
IEEE
104views Hardware» more  ITC 1995»
13 years 11 months ago
Synthesis of Mapping Logic for Generating Transformed Pseudo-Random Patterns for BIST
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...
Nur A. Touba, Edward J. McCluskey